The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Matchmaking: distributed resource management for high throughput computing
Abstract
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not adapt well to distributed systems, particularly those built to support high throughput computing. Obstacles include heterogeneity of resources, which make uniform allocation algorithms difficult to formulate, and distributed ownership, leading to widely varying allocation policies. Faced with these problems, we developed and implemented the classified advertisement (classad) matchmaking framework, a flexible and general approach to resource management in distributed environment with decentralized ownership of resources. Novel aspects of the framework include a semi structured data model that combines schema, data, and query in a simple but powerful specification language, and a clean separation of the matching and claiming phases of resource allocation. The representation and protocols result in a robust, scalable and flexible framework that can evolve with changing resources. The framework was designed to solve real problems encountered in the deployment of Condor, a high throughput computing system developed at the University of Wisconsin-Madison. Condor is heavily used by scientists at numerous sites around the world. It derives much of its robustness and efficiency from the matchmaking architecture.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Globus: a Metacomputing Infrastructure Toolkit
Foster, I., & Kesselman, C. (1997) · The International Journal of Supercomputer Applications and High Performance Computing · doi:10.1177/109434209701100205 · Cited by 3,133
Condor-a hunter of idle workstations
Litzkow, M. J., Livny, M., & Mutka, M. W. (2003) · [1988] Proceedings. The 8th International Conference on Distributed · doi:10.1109/dcs.1988.12507 · Cited by 2,245
Self-citationEnd-To-End Arguments In System Design
And, S. R., Saltzer, J. H., Reed, D. P., & Clark, D. D. (1984) · Cited by 2,130
A resource management architecture for metacomputing systems
Czajkowski, K., Foster, I., Karonis, N., Kesselman, C., Martin, S., Smith, W., & Tuecke, S. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0053981 · Cited by 782
Experience with the Condor distributed batch system
Litzkow, M., & Livny, M. (2002) · doi:10.1109/eds.1990.138057 · Cited by 129
Self-citationInferring structure in semistructured data
Nestorov, S., Abiteboul, S., & Motwani, R. (1997) · ACM SIGMOD Record · doi:10.1145/271074.271084 · Cited by 120
Cited by
Distributed computing in practice: the Condor experience
Thain, D., Tannenbaum, T., & Livny, M. (2005) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.938 · Cited by 1,886
Self-citationLarge-scale cluster management at Google with Borg
Verma, A., Pedrosa, L., Korupolu, M., Oppenheimer, D., Tune, E., & Wilkes, J. (2015) · Proceedings of the Tenth European Conference on Computer Systems · doi:10.1145/2741948.2741964 · Cited by 1,468
Quincy: fair scheduling for distributed computing clusters
Isard, M., Prabhakaran, V., Currey, J., Wieder, U., Talwar, K., & Goldberg, A. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629601 · Cited by 856
A Software Defined Fog Node Based Distributed Blockchain Cloud Architecture for IoT
Sharma, P. K., Chen, M.-Y., & Park, J. H. (2018) · IEEE Access · doi:10.1109/access.2017.2757955 · Cited by 676
An architecture for a secure service discovery service
Czerwinski, S. E., Zhao, B. Y., Hodes, T. D., Joseph, A. D., & Katz, R. H. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313462 · Cited by 610
FireWorks: a dynamic workflow system designed for high‐throughput applications
Jain, A., Ong, S. P., Chen, W., Medasani, B., Qu, X., Kocher, M., Brafman, M., Petretto, G., Rignanese, G., Hautier, G., et al. (2015) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.3505 · Cited by 547
Thain, D., Tannenbaum, T., & Livny, M. (2003) · Grid Computing · doi:10.1002/0470867167.ch11 · Cited by 505
Self-citationOn Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing
Foster, I., & Iamnitchi, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45172-3_11 · Cited by 504
QoS guided Min-Min heuristic for grid task scheduling
He, X., Sun, X., & von Laszewski, G. (2003) · Journal of Computer Science and Technology · doi:10.1007/bf02948918 · Cited by 420
The Pilot Way to Grid Resources Using glideinWMS
Sfiligoi, I., Bradley, D. C., Holzman, B., Mhashilkar, P., Padhi, S., & Wurthwein, F. (2009) · 2009 WRI World Congress on Computer Science and Information Engineering · doi:10.1109/csie.2009.950 · Cited by 396
A CyberGIS Framework for the Synthesis of Cyberinfrastructure, GIS, and Spatial Analysis
Wang, S. (2010) · Annals of the Association of American Geographers · doi:10.1080/00045601003791243 · Cited by 296
A new paradigm: Data-aware scheduling in grid computing
Kosar, T., & Balman, M. (2009) · Future Generation Computer Systems · doi:10.1016/j.future.2008.09.006 · Cited by 266
Metadata
- Authors
- Raman, R., Livny, M., & Solomon, M.
- Venue
- Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244)
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-27
- Pages
- 140-146
- OpenAlex
- W1809943808
- Cited by
- 747
- References
- 6
- FWCI
- 40.04
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.