The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems
Abstract
Dynamic mapping (matching and scheduling) heuristics for a class of independent tasks using heterogeneous distributed computing systems are studied. Two types of mapping heuristics are considered, immediate mode and batch mode heuristics. Three new heuristics, one for batch mode and two for immediate mode, are introduced as part of this research. Simulation studies are performed to compare these heuristics with some existing ones. In total five immediate mode heuristics and three batch mode heuristics are examined. The immediate mode dynamic heuristics consider, to varying degrees and in different ways, task affinity for different machines and machine ready times. The batch mode dynamic heuristics consider these factors, as well as aging of tasks waiting to execute. The simulation results reveal that the choice of which dynamic mapping heuristic to use in a given heterogeneous environment depends on parameters such as (a) the structure of the heterogeneity among tasks and machines and (b) the arrival rate of the tasks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Probability, Random Variables, and Stochastic Processes.
Abrahams, J., & Papoulis, A. (1984) · Journal of the American Statistical Association · doi:10.2307/2288754 · Cited by 16,226
The Grid 2: Blueprint for a New Computing Infrastructure
Foster, I. T., & Kesselman, C. (1998) · Cited by 7,637
Scheduling: Theory, Algorithms, and Systems
(1996) · IIE Transactions · doi:10.1080/15458830.1996.11770714 · Cited by 6,210
Probability, random variables and stochastic processes
Proakis, J. (1985) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1985.1164715 · Cited by 4,568
The Art of Computer Systems Performance Analysis.
Jain, R. (1990) · Int. CMG Conference · Cited by 2,280
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Ibarra, Ó. H., & Kim, C. E. (1977) · Journal of the ACM · doi:10.1145/322003.322011 · Cited by 798
Wang, L., Siegel, H. J., Roychowdhury, V. P., & Maciejewski, A. A. (1997) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1997.1392 · Cited by 407
Self-citationBraun, T. D., Siegal, H. J., Beck, N. B., Bölöni, L. L., Maheswaran, M., Reuther, A., Robertson, J. P., Theys, M. D., Yao, B., Hensgen, D. A., et al. (2003) · Heterogeneous Computing Workshop (HCW) · doi:10.1109/hcw.1999.765093 · Cited by 241
Self-citationDynamic scheduling—a survey of research
Suresh, V., & Chaudhuri, D. (1993) · International Journal of Production Economics · doi:10.1016/0925-5273(93)90007-8 · Cited by 161
Adaptive load sharing in heterogeneous distributed systems
Mirchandaney, R., Towsley, D., & Stankovic, J. A. (1990) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(90)90118-9 · Cited by 115
Cited by
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
A taxonomy of Data Grids for distributed data sharing, management, and processing
Venugopal, S., Buyya, R., & Ramamohanarao, K. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132955 · Cited by 351
Load Balancing Based Task Scheduling with ACO in Cloud Computing
Gupta, A., & Garg, R. (2017) · 2017 International Conference on Computer and Applications (ICCA) · doi:10.1109/comapp.2017.8079781 · Cited by 88
Metadata
- Authors
- Maheswaran, M., Ali, S., Siegel, H. J., Hensgen, D., & Freund, R. F.
- Venue
- Journal of Parallel and Distributed Computing
- Publisher
- Elsevier BV
- Published
- 1999-11
- Volume
- 59
- Issue
- 2
- Pages
- 107-131
- ISSN
- 0743-7315 (ISSN-L)
- OpenAlex
- W1996689181
- Cited by
- 819
- References
- 11
- FWCI
- 12.93
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems. https://app.cochat.ai/papers/10.1006/jpdc.1999.1581
- The paper
- Maheswaran, M., Ali, S., Siegel, H. J., Hensgen, D., & Freund, R. F. (1999). Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems. Journal of Parallel and Distributed Computing. https://doi.org/10.1006/jpdc.1999.1581
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.
