Article

A comprehensive model for arbitrary result extraction

Authors:

Dorothea Beringer,

Gio WiederholdAuthors Info & Claims

SAC '02: Proceedings of the 2002 ACM symposium on Applied computing

Pages 314 - 321

https://doi.org/10.1145/508791.508854

Published: 11 March 2002 Publication History

Abstract

Within the realms of workflow management and grid computing, scheduling of distributed services is a central issue. Most schedulers balance time and cost to fit within a client's budget, while accepting explicit data dependencies between services as the best resolution for scheduling. Results are extracted from one service in total, and then simply forwarded to the next service. However, distributed objects and remote services adhere to various standards for data delivery and result extraction. There are multiple means of requesting results and multiple ways of delivering those results. By examining several popular and idiosyncratic methods, we have developed a comprehensive model that combines the functionality of all component models. This model for arbitrary result extraction from distributed objects provides increased flexibility for object users, and an increased audience for module providers. In turn, intelligent schedulers may leverage these result extraction features.

References

[1]

D. Beringer, et al., "A Language and System for Composing Autonomous, Heterogeneous and Distributed Megamodules," DEXA 98: Large-Scale Software Composition, Vienna, August 1998.]]

Digital Library

[2]

B. Chapman, et al., "Opus: A Coordination Language for Multidisciplinary Applications," ICASE Tech Report 97-30, Jun 1997.]]

Digital Library

[3]

M. Haines and P. Mehrotra, "Exploiting Parallelism in Multidisciplinary Applications Using Opus," Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, San Francisco, CA, February 1995.]]

[4]

J. Hanly, E. Koffman and J. Horvath, Porgram Design for Engineers, Addison-Wesley, Menlo Park, CA, 1995.]]

Digital Library

[5]

ICASE Research Quarterly, Vol. 4, No. 1, March 1995.]]

[6]

Workflow Management Facility, Revised Submission, OMG Document Number: bom/98-06-07, July 1998.]]

[7]

L. Melloul, et al, "CPAM, A Protocol for Software Composition," CAiSE'99, Heidelberg, Germany, June 1999 (Springer LNCS).]]

Digital Library

[8]

N. Sample, et al., "CLAM: Composition Language for Autonomous Megamodules," Third Int'l Conference on Coordination Models and Languages, COORD'99, Amsterdam, April 26-28, 1999 (Springer LNCS).]]

Digital Library

[9]

Simple Workflow Access Protocol (SWAP), Keith Swenson, IETF internet draft, August 1998.]]

[10]

G. Wiederhold, P. Wegner, and S. Ceri, "Towards Megaprogramming: A Paradigm for Component-Based Programming"; Communications of the ACM, 1992(11): p.89-99.]]

Digital Library

[11]

Workflow Management Coalition, The Workflow Reference Model, Document Number TC00-1003, Nov 1994.]]

[12]

C. Bartlett, et al., "Pipeline Expansion in Coordinated Applications," International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'99), June 1999.]]

[13]

T. Pratt and M. Zelkowitz, Programming Languages, Design and Implementation, 1996, Prentice Hall, Inc.]]

Digital Library

[14]

G. Wiederhold, et al., "Composition of Multi-site Services," 4th World Conference on Integrated Design and Process Technology IDPT'99, Kusadasi, Turkey, June 1999.]]

[15]

T. Bray, J. Paoli and C. Sperberg-McQueen, "Extensible Markup Language (XML) 1.0," W3C Recommendation, February 1998.]]

[16]

A. Davidson, et al., "Schema for Object-Oriented XML 2.0," W3C Note, July 1999.]]

[17]

J. Robie, "XQL Tutorial," March 1999 (http://metalab.unc.edu/xql/xql-tutorial.html).]]

[18]

A. Deutsch, et al., "XML-QL: A Query Language for XML," submission to the W3C, August 1998.]]

[19]

J. Eder, et al., "Time Management in Workflow Systems," 3rd International Conference on Business Information Systems, 1999.]]

[20]

H. Pozewaunig, J. Eder, and W. Liebhart, "ePERT: Extending PERT for Workflow Management Systems," First EastEuropean Symposium on Advances in Database and Information Systems ADBIS ' 97, St. Petersburg, Russia, September 1997.]]

[21]

F. Berman, High Performance Schedulers in Building a Computational Grid, I. Foster and C. Kesselman, editors, Morgan Kaufmann, 1998.]]

[22]

R. Buyya, J. Giddy, D. Abramson, "A Case for Economy Grid Architecture for Service-Oriented Grid Computing," 10th IEEE International Heterogeneous Computing Workshop (HCW 2001), In conjunction with IPDPS 2001, April 2001.]]

Digital Library

[23]

P. Keyani, N. Sample, and G. Wiederhold. "Scheduling Under Uncertainty: Planning for the Ubiquitous Grid," technical report, Stanford Database Group.]]

Cited By

Pautasso CAlonso G(2004)From web service composition to megaprogrammingProceedings of the 5th international conference on Technologies for E-Services10.1007/978-3-540-31811-8_4(39-53)Online publication date: 29-Aug-2004
https://dl.acm.org/doi/10.1007/978-3-540-31811-8_4
Peng JWang J(2004)On-Demand Services Composition and Infrastructure ManagementGrid and Cooperative Computing10.1007/978-3-540-24679-4_94(511-518)Online publication date: 2004
https://doi.org/10.1007/978-3-540-24679-4_94
Omicini AOssowski SLamont GHaddad HPapadopoulos GPanda B(2002)Editorial messageProceedings of the 2002 ACM symposium on Applied computing10.1145/508791.508849(286-287)Online publication date: 11-Mar-2002
https://dl.acm.org/doi/10.1145/508791.508849

Index Terms

A comprehensive model for arbitrary result extraction

Recommendations

Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines

We present a polynomial time algorithm for constructing an optimal schedule, if a feasible schedule exists, for tthe following multimachine scheduling problem. There are n unit-time jobs, with arbitrary release times and deadlines, and m identical ...
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs

We consider the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs. Each job consists of several operations that belong to different families. In a schedule, each family of job operations may be processed in ...
Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes

This article considers the problem of scheduling two batch-processing machines in flow shop where the jobs have arbitrary sizes and the machines have limited capacity. The jobs are processed in batches and the total size of jobs in each batch cannot ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '02: Proceedings of the 2002 ACM symposium on Applied computing

March 2002

1200 pages

ISBN:1581134452

DOI:10.1145/508791

Conference Chair:
Gary B. Lamont
Air Force Institute of Technology, USA
,
Program Chairs:
Hisham Haddad
Kennesaw State Univ., USA
,
George Papadopoulos
Univ. of Cyprus, Cyprus
,
Publications Chair:
Brajendra Panda
University of Arkansas, USA

Copyright © 2002 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 March 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SAC02

Sponsor:

SIGAPP

SAC02: 2002 ACM Symposium on Applied Computing

March 11 - 14, 2002

Madrid, Spain

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
313
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Pautasso CAlonso G(2004)From web service composition to megaprogrammingProceedings of the 5th international conference on Technologies for E-Services10.1007/978-3-540-31811-8_4(39-53)Online publication date: 29-Aug-2004
https://dl.acm.org/doi/10.1007/978-3-540-31811-8_4
Peng JWang J(2004)On-Demand Services Composition and Infrastructure ManagementGrid and Cooperative Computing10.1007/978-3-540-24679-4_94(511-518)Online publication date: 2004
https://doi.org/10.1007/978-3-540-24679-4_94
Omicini AOssowski SLamont GHaddad HPapadopoulos GPanda B(2002)Editorial messageProceedings of the 2002 ACM symposium on Applied computing10.1145/508791.508849(286-287)Online publication date: 11-Mar-2002
https://dl.acm.org/doi/10.1145/508791.508849

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents