An Algorithm for Task Scheduling in Heterogeneous Computing Environment

REFERENCES

• G C Sih & E A Lee, A Compile-Time Scheduling Heuristic for Interconnected-Constrained Heterogeneous Processor Architectures, IEEE Trans on Parallel and Distributed Systems, vol 4, no 2, pp 175–186, Feb 1993.
   Web of Science ®Google Scholar
• WW Chu, M T Lan & Hellerstein, Estimation of Intermodule Communication (IMC) and its Applications in Distributed Processing Systems, IEEE Trans on Computers, vol c 33, no 8, pp 691–699, Aug 1984.
   Web of Science ®Google Scholar
• C Hongtu, Distributed Dynamic Scheduling of Composite Tasks on Grid Computing System, Department of Electrical & Computer Engineering, University of Manitoba, Canada, 2001.
   Google Scholar
• S Zhou, J Wang, X Zheng & P Delisle, Utopia: A Load Sharing Facility for Large, Heterogeneous Distributed Computer Systems, Technical Report CSRI-257, April 1992.
   Google Scholar
• V Rajaraman & C S R Murthy, Parallel Computers—Architecture and Programming, Prentice Hall of India, 1999.
   Google Scholar
• M J Quinn, Parallel Computing: Theory and Practice, McGraw-hill, 2000.
   Google Scholar
• HE Rawani, G T Lewis & H H Ali, Task Scheduling in Parallel and Distributed Systems, Prentice Hall Inc., 1994.
   Google Scholar
• Y K Wok & I Ahmad, Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors, ACM Computing Surveys.
   Google Scholar
• HE Rewani, H H Ali & Lewis, Task Scheduling in Multiprocessing Systems, IEEE Computer, vol 28, no 12, pp 27–37, December 1995.
   Google Scholar
• S Baskiyar & P C SaiRanga, Scheduling DAG's on heterogeneous multiprocessor systems to minimize finish time, Proc PDCS, ISCA, 2003.
   Google Scholar
• Sanjeev Baskiyar, Ph D & Prashanth C SaiRanga, Scheduling Directed a-cyclic Task Graphs on Heterogeneous Network of Workstations to Minimize Schedule Length, 2002 Department of Computer Science & Software Engineering Auburn University, Auburn, AL 36849, [email protected].
   Google Scholar
• H Topcuoglu, S Hariri & M Y Wu, Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing, IEEE Trans on Parallel and Distributed Systems, vol 13, no 3, pp 260–274, March 2002.
   Web of Science ®Google Scholar
• Y K Kwok & I Ahmad, Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors, IEEE Trans on Parallel and Distributed Systems, vol 7, no 5, pp 506–521, May 1996.
   Web of Science ®Google Scholar
• Olivier Beaumont, La BRI Arnaud Legrabd & Yves Robert, Static scheduling strategies for heterogeneous systems, 2002.
   Google Scholar
• A K Sarje & G Sagar, Heuristic Model for Task Allocation in Distributed Computer Systems, IEE Proceedings-E, vol 138, no 5, 1991.
   Google Scholar
• E S H Hou, N Ansari & H Ren, A Genetic Algorithm for Multiprocessor Scheduling, IEEE Trans on Parallel and Distributed Systems, vol 5, no 2, pp 113–120, Feb 1994.
   Web of Science ®Google Scholar
• P Shroff, D W Watson, N S Flann & R Freund, Genetic Simulated Annealing for Scheduling Data-Dependent Tasks in Heterogeneous Environments, Proc Heterogeneous Computing Workshop, pp 98–104, 1996.
   Google Scholar
• M Wu, W Shu & J Gu, Local Search for DAG Scheduling and Task Assignment, Proc Int'l Conf Parallel Processing, pp 174–180, 1997.
   Google Scholar
• G Park, B Shirazi & J Marquis, DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems, Proc Int'l Conf Parallel Processing, pp 157–166, 1997.
   Google Scholar
• T Yang & A Gerasoulis, DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors, IEEE Trans on Parallel and Distributed Systems, vol 5, no 9, pp 951–967, Sept 1994.
   Web of Science ®Google Scholar
• O Beaumont, V Boudet & Y Robert, A Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors, Proc IPDPS, 2002.
   Google Scholar
• AL Thomas, K M Chandy & J R Dickson, A Comparison of List Schedules for Parallel Processing Systems, Communications of the ACM, 17(12), pp 685–690, December 1974.
   Web of Science ®Google Scholar
• A Dogan & F Ozguner, Matching and Scheduling Algorithms for Minimizing Execution Time and failure Probability of Applications in Heterogeneous Computing, IEEE Trans on Parallel and Distributed Systems, vol 13, no 3, pp 308–323, March 2002.
   Web of Science ®Google Scholar
• M Iverson, F Ozguner & G Follen, Parallelizing Existing Applications in a Distributed Heterogeneous Environments, Proc Heterogeneous Computing Workshop, pp 93–100, 1995.
   Google Scholar
• A Radullescu & AJCV Gemund, Low-Cost Task Scheduling for Distributed-Memory Machines, IEEE Trans on Parallel and Distributed Systems, vol 13, no 6, pp 648–658, June 2002.
   Web of Science ®Google Scholar
• S B Lippman, C++ Primer, Second Edition, Addison Wesley, 1999.
   Google Scholar
• R Lafore, Object Oriented Programming in Turbo C++, Galgotia Publications, 2001.
   Google Scholar
• A A Radenski, Object-Oriented Programming and Paralelism, Department of Computer Science, Winston-Salem State University, 2002.
   Google Scholar
• H Schildt, C++ The Complete Reference, Third Edition, Tata Mc Graw Hill Publishing Company, 2002.
   Google Scholar