17
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

An Effective Bi-Criteria and Contention Awareness Scheduling in Heterogeneous Distributed Systems

, , &
Pages 759-769 | Published online: 01 Mar 2013

References

  • Assayad, A. Girault and H. Kalla, “A bi-criteria scheduling heuristic for distributed embedded systems under reliability and real-time constraints”. In Proc. of the International Conference on Dependable Systems and Networks (DSN), Florence, 2004.
  • R. Al. Omari R, Somani, and G. Manimaran, “An adaptive scheduling of soft real-time tasks in multiprocessor systems”. Journal of Parallel and Distributed Computing, Netherlands, 2005.
  • Y.K. Kumar and I. Ahmad, “Link contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processors”, Cluster Computing: the Journal of Networks, Software Tools and Applications, New York, 2000.
  • C. H. Yang, G. Deconinck, and W. H. Gui, “Fault-tolerant Scheduling for Real-time Embeded Control Systems”, Journal of Computer Science and Technology, Beijing, 2004.
  • X. Qin, H. Jiang and D. R. Swanson, “An efficient fault-tolerant scheduling algorithm for real-time tasks with precedence constraints in heterogeneous systems”, In Proc of the Conference on Parallel Processing(ICPP), British Columbia, 2002.
  • W. Sun, C. Yu, X. Defago and Y. Inoguchi, “Hybrid Overloading and Stochastic analysis for Redundant Scheduling in Real-time Multiprocessor Systems,” In Proc. of 26th IEEE Reliable Distributed Systems (SRDS), Beijing, 2007.
  • Yi He, Zili Shao, Bin Xiao, Qingfeng Zhuge and Edwin Sha“, Reliability driven task scheduling for heterogeneous systems”, In Proc. of International Conference on Parallel and Distributed Computing and Systems (IPDPS), Nice, 2003.
  • X. Qin and H. Jiang, “Dynamic, reliability-driven scheduling of parallel real-time jobs in heterogeneous systems”, In Proc of the Conference on Parallel Processing (ICPP), Valencia, 2001.
  • Dogan. A, Ozguner. F, “Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogeneous computing”, IEEE Transactions on Parallel and Distributed Systems, American, 2002.
  • J. Dongarra, E. Jean, “Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogamous systems”, In Proc. of Symposium on Parallelism in Algorithms and Architectures (SPAA), Santiago, 2007.
  • O. Sinnen, L. Sousa,“ List scheduling extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures”, Parallel Computing, Netherlands, 2004.
  • O. Beaumont, V. Boudet, and Y. Robert, “A realistic model and an efficient heuristic for scheduling with heterogeneous processors”, In Proc. of International Conference on Parallel and Distributed Computing and Systems (IPDPS), Florida, 2002.
  • T. Kalinowski, I. Kort, and D. Trystram, “list scheduling of general task graphs under LogP,” Parallel Computing, Parallel Computing, Netherlands, 2000.
  • O. Sinnen, L. Sousa, “Communication contention in task scheduling”, IEEE Transactions on Parallel and Distributed Systems, American, 2005.
  • Anne Benoit, Mourad Hakem and Yves Robert, “Contention awareness and fault-tolerant scheduling for precedence constrained tasks in heterogeneous systems”, Parallel Computing, Netherlands, 2009.
  • G. Q. Liu, K. L. Poh, M. Xie, “Iterative list scheduling for heterogeneous computing. Journal of Parallel and Distributed Computing, Netherlands, 2005.
  • A. Dogan, F. Ozguner, “Bi-objective Scheduling Algorithms for Execution Time-Reliability Trade-off in Heterogeneous Computing Systems”, The Computer Journal, Oxford, 2005.
  • Mourad. Hakem, Frank. Butelle, “A Bi-objective Algorithm for Scheduling Parallel Applications on Heterogeneous Systems Subject to Failures”, In Renpar 17, Roussillon, 2006.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.