Exact algorithms for a task assignment problem

Parallel Processing Letters

Volumn 19, Issue 3, 2009, Pages 451-465

  Kaya, Kamer ^a   UÇar, Bora ^b  

^a BILKENT UNIVERSITY   (Turkey)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

A; Heterogeneous computing systems; Search; Task assignment; Task interaction graph

Indexed keywords

A; HETEROGENEOUS COMPUTING SYSTEMS; SEARCH; TASK ASSIGNMENT; TASK INTERACTION GRAPH;

COMPUTATIONAL COMPLEXITY; HETEROGENEOUS NETWORKS; TRAVELING SALESMAN PROBLEM;

COMPUTER SCIENCE;

EID: 68749086213     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S012962640900033X     Document Type: Conference Paper

References (17)

1. S. Ali, H. J. Siegel, M. Maheswaran, D. Hensgen, and S. Ali. Task execution time modeling for heterogeneous computing systems. In Cauligi Raghavendra, editor, Proceedings of the 9th Heterogeneous Computing Workshop (HCW 2000), pages 185-199, Cancun, Mexico, May 2000. IEEE.
2. B. Arafeh, K. Day, and A. Touzene. A multilevel partitioning approach for efficient tasks allocation in heterogeneous distributed systems. J. Syst. Architect., 54:530-548, 2008.
3. A. Billionnet. Allocating tree structured programs in a distributed system with uniform communication costs. IEEE T. Parall. Distr., 5(4):445-448, 1994.
4. S. H. Bokhari. A shortest tree algorithm for optimal assignments across space and time in distributed processor system. IEEE T. Software Eng., 7:583-589, 1981.
5. H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman. Heuristics for parameter sweep applications in Grid environments. In Proc. Ninth Heterogeneous Computing Workshop, pages 349-363. IEEE Computer Society Press, 2000.
6. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, first edition, 1990.
7. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
8. J. Gehring and A. Reinefeld. MARS - A framework for minimizing the job execution time in a metacomputing environment. Future Gener. Comp Sy., 12:97-99, 1996.
9. M. Kafil and I. Ahmad. Optimal task assignment in heterogeneous distributed computing systems. IEEE Concurr., 6:42-51, 1998.
10. Y.-K. Kwok and I. Ahmad. On multiprocessor task scheduling using efficient state space search approaches. J. Parallel Distr. Com., 65:1515-1532, 2005.
11. S. Menon. Effective reformulations for task allocation in distributed systems with a large number of communicating tasks. IEEE T. Knowl. Data En., 16:1497-1508, 2004.
12. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Pearson Education Inc., New Jersey, USA, second edition, 2003.
13. H. S. Stone. Multiprocessor scheduling with the aid of network flow algorithms. IEEE T. Software Eng., SE-3:85-93, 1977.
14. A. Tom P. and C. S. R. Murthy. An improved algorithm for module allocation in distributed computing systems. J. Parallel Distr. Com., 42:82-90, 1997.
15. A. Tom P. and C. S. R. Murthy. Optimal task allocation in distributed systems by graph matching and state space search. J Syst. Software, 46:59-75, 1999.
16. B. Uçar, C. Aykanat, K. Kaya, and M. Ikinci. Task assignment in heterogeneous computing systems. J. Parallel Distr. Com., 66:32-46, 2006.
17. J. B. Weissman and X. Zhao. Run-time support for scheduling parallel applications in heterogeneous nows. In HPDC '97: Proc. of the 6th International Symposium on High Performance Distributed Computing, pages 347-355, Portland, USA, 1997. IEEE.