Article

A joint data and computation scheduling algorithm for the grid

Authors:

Fangpeng Dong,

Selim G. AklAuthors Info & Claims

Euro-Par'07: Proceedings of the 13th international Euro-Par conference on Parallel Processing

Pages 587 - 597

Published: 28 August 2007 Publication History

Publisher Site

Abstract

In this paper a new scheduling algorithm for the Grid is introduced. The new algorithm (JDCS) combines data transfer and computation scheduling by a back-trace technique to reduce remote data preloading delay, and is aware of resource performance fluctuation in the Grid. Experiments show the effectiveness and adaptability of this new approach in the Grid environment.

References

[1]

Yang, L., Schopf, J. M., Foster, I.: Conservative Scheduling: Using Predicted Variance to Improve Scheduling Decisions in Dynamic Environments. Super-Computing (2003)

Digital Library

Google Scholar

[2]

Aggarwal, K., Kent, R. D.: An Adaptive Generalized Scheduler for Grid Applications. In: The 19th HPCS (2005)

Digital Library

Google Scholar

[3]

Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Trans. on Parallel and Distributed Systems 13(3), 260-274 (2002)

Digital Library

Google Scholar

[4]

Lu, D., Dinda, P.: Synthesizing Realistic Computational Grids. Super-Computing (2003)

Digital Library

Google Scholar

[5]

Dick, R. P., Rhodes, D. L., Wolf, W.: TGFF Task Graphs for Free. In: The 6th International Workshop on Hardware/Software Co-design (1998)

Digital Library

Google Scholar

[6]

El-Rewini, H., Lewis, T., Ali, H.: Task Scheduling in Parallel and Distributed Systems. PTR Prentice-Hall, Englewood Cliffs (1994)

Digital Library

Google Scholar

[7]

Park, S., Kim, J.: Chameleon: a Resource Scheduler in a Data Grid Environment. In: The 3rd CCGrid (2003)

Digital Library

Google Scholar

[8]

Ranganathan, K., Foster, I.: Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications. In: The 11th HPDC (2002)

Digital Library

Google Scholar

[9]

Alhusaini, A. H., Prasanna, V. K., Raghavendra, C. S.: A Unified Resource Scheduling Framework for Heterogeneous Computing Environments. In: The 8th HCW Workshop (1999)

Digital Library

Google Scholar

[10]

Desprez, F., Vernois, A.: Simultaneous Scheduling of Replication and Computation for Bioinformatic Applications on the Grid. In: Proc. of CLADE2005 (2005)

Google Scholar

[11]

Venugopal, S., Buyya, R.: A Deadline and Budget Constrained Scheduling Algorithm for eScience Applications on Data Grids. In: Hobbs, M., Goscinski, A. M., Zhou, W. (eds.) ICA3PP 2005. LNCS, vol. 3719, Springer, Heidelberg (2005)

Digital Library

Google Scholar

[12]

Dong, F., Akl, S.: PFAS: A Resource Performance Fluctuation Aware Workflow Scheduling Algorithm for Grid Computing. In: The 16th HCW Workshop (2007)

Google Scholar

Cited By

View all

Szepieniec TBubak M(2008)Investigation of the DAG eligible jobs maximization algorithm in a gridProceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing10.1109/GRID.2008.4662819(340-345)Online publication date: 29-Sep-2008
https://dl.acm.org/doi/10.1109/GRID.2008.4662819

Index Terms

Recommendations

A Data-Intensive Workflow Scheduling Algorithm for Grid Computing
CHINAGRID '09: Proceedings of the 2009 Fourth ChinaGrid Annual Conference

The data-intensive workflow in scientific and enterprise grids has gained popularity in recent times. Data-intensive workflow needs to access, process and transfer large datasets that may each be replicated on different data hosts. Because of the large ...
The Grid Resource Broker workflow engine
2nd International Workshop on Workflow Management and Applications in Grid Environments (WaGe2007)

Increasingly, complex scientific applications are structured in terms of workflows. These applications are usually computationally and-or data intensive and thus are well suited for execution in grid environments. Distributed, geographically spread ...
An Adaptive Scoring Job Scheduling algorithm for grid computing

When human culture advances, current problems in science and engineering become more complicated and need more computing power to tackle and analyze. A supercomputer is not the only choice for solving complex problems any more as a result of the speed-...

Comments

Information & Contributors

Information

Published In

Euro-Par'07: Proceedings of the 13th international Euro-Par conference on Parallel Processing

August 2007

969 pages

ISBN:3540744657

Editors:
Anne-Marie Kermarrec
IRISA/INRIA, Campus de Beaulieu, Rennes Cedex, France
,
Luc Bougé
IRISA/ENS Cachan, Campus de Beaulieu, Rennes Cedex, France
,
Thierry Priol
IRISA/INRIA, Campus de Beaulieu, Rennes Cedex, France

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 28 August 2007

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Szepieniec TBubak M(2008)Investigation of the DAG eligible jobs maximization algorithm in a gridProceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing10.1109/GRID.2008.4662819(340-345)Online publication date: 29-Sep-2008
https://dl.acm.org/doi/10.1109/GRID.2008.4662819

Abstract

References

Cited By

Index Terms

Recommendations

A Data-Intensive Workflow Scheduling Algorithm for Grid Computing

The Grid Resource Broker workflow engine

An Adaptive Scoring Job Scheduling algorithm for grid computing

Comments

Information

Published In

Sponsors

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations