Optimization method for scheduling length and the number of processors on multiprocessor systems

Proceedings - The 2009 International Conference on Computer Engineering and Systems, ICCES'09

Volumn , Issue , 2009, Pages 231-236

  Youness, Hassan ^a   Hassan, Mohammed ^b   Sakanushi, Keishi ^c   Takeuchi, Yoshinori ^c   Imai, Masaharu ^c   Salem, Ashraf ^d   Wahdan, Abdel Moniem ^d   Moness, Mohammed ^a  

^a MINIA UNIVERSITY   (Egypt)

^b IST ^*

^c OSAKA UNIVERSITY   (Japan)

^d Ain Shams University   (Egypt)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS; OPTIMAL SYSTEMS; OPTIMIZATION ALGORITHMS;

HIGH PERFORMANCE ALGORITHMS; LARGE PROBLEMS; MULTI PROCESSOR SYSTEMS; OPTIMALITY; OPTIMIZATION METHOD; OVERALL EXECUTION; PRECEDENCE CONSTRAINTS; PROBLEM SIZE; TARGET SYSTEMS; TASKS GRAPH;

SCHEDULING ALGORITHMS;

EID: 77950442619     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCES.2009.5383277     Document Type: Conference Paper

References (28)

1. T.C. Hu. "Parallel sequencing and assembly line problems", Operation Research 9(6):841-848, 1961.
2. M. R. Garey and D. S. Johnson. "Computers and Intractability: A Guide to the Theory of NP-Completeness", W. H. Freeman and Company, 1979.
3. J. D. Ullman. "NP-complete scheduling problems", J. Comput. Syst. Sci. 10(3):384-393, 1975.
4. Jr. E. G. Coffman and R. L. Graham. "Optimal scheduling for two processor systems", Acta Informatica 1:200-213, 1972.
5. V. Krishnamoorthy and K. Efe. "Task scheduling with and without communication delays: A unified approach", European Journal of Operational Research 89:366-379, 1996. (Pubitemid 126386753)
6. T. A. Varvarigou, V. P. Roychowdhury, T. Kailath, and E. Lawler. "Scheduling in and out forests in the presence of communication delays", IEEE Transactions Parallel and Distributed Systems 7(10):1065-1074, 1996. (Pubitemid 126780464)
7. G. Djordjevic and M. Tosic. "A compile-time scheduling heuristic for multiprocessor architectures", The Computer Journal 39(8):663-674, 1996.
8. Y.-K. Kwok and I. Ahmad. "Dynamic critical path scheduling: An elective technique for allocating task graphs to multiprocessors", IEEE Transactions on Parallel and Distributed Systems 7(5):506-521, 1996.
9. S. Manoharan and P. Thanisch. "Assigning dependency graphs onto processor networks", Parallel Computing 17:63-73, 1991.
10. A.K.SarjeandG.Sagar. "Heuristic model for task allocation in distributed computer systems", IEE Proceedings-E 138(5):313-318, 1991.
11. G. C. Sih and E. A. Lee. "A compile-time scheduling heuristic for interconnection constrained heterogeneous processor architectures", IEEE Transactions on Parallel and Distributed Systems 4(2):175-187, 1993.
12. J. Blazewicz, M. Drozdowski, and K. Ecker. "Management of resources in parallel systems", In J. Blazewicz, K. Ecker, B. Plateau, D. Trystran, eds., Handbook on Parallel and Distributed Processing, pages 263-341. Springer, 2000.
13. nd edition, Prentice Hall, 2002.
14. S. Baskiyar, C. Dickinson, "Scheduling Directed Acyclic Task Graphs on Heterogeneous Processors Using Task Duplication", Lecture Notes in Computer Science, vol.2913, Springer, Berlin, 2003, pp. 259-267. (Pubitemid 38038532)
15. D.R. Smith, "Random trees and the analysis of branch-and-bound procedures", J. ACM 31 (1) 163-188. (January 1984)
16. H. Topcuoglu, S. Hariri, M.-Y. Wu, "Performance-effective and low complexity task scheduling for heterogeneous computing parallel and distributed systems", IEEE Trans. Parallel Distributed Systems 13 (3) (March 2002).
17. H.C. Chou, C.P. Chung, "An Optimal Instruction scheduler for superscalar processor", IEEE Trans. Parallel Distributed Systems 6 (3) (1995) 303-313.
18. Ahmad, Yu-Kwong Kwok, "Optimal and near-optimal allocation of precedence-constrained tasks to parallel processors: defying the high complexity using effective search techniques", in: Proceedings of 1998 International Conference on Parallel Processing, 1998, pp. 424-431.
19. A. Billionnet, M.C. Costa, A. Sutter, "An efficient algorithm for a task allocation problem", J. Assoc. Comput. Mach. 39 (3) (1992) 502-518.
20. C.J. Hou, K.G. Shin, "Allocation of periodic task modules with precedence and deadline constraints in distributed realtime systems", IEEE Trans. Comput. 48 (12) (December 1997) 1336-1356.
21. Y.K. Kwok, I. Ahmad, "Static scheduling algorithms for allocating directed task graphs to multiprocessors", ACM Comput. Surveys 31 (4) (December 1999) 406-471.
22. C.H. Lee, K.G. Shin, "Optimal task assignment in homogeneous networks", IEEE Trans. Parallel Distributed Systems 8 (2) (1997) 119-128.
23. D.T. Peng, K.G. Shin, "Optimal scheduling of cooperative tasks in a distributed system using an enumerative method", IEEE Trans. Software Eng. 19 (3) (1993) 253-267.
24. P.Y. Richard, E.Y.S. Lee, M. Tsuchiya, "A task allocation model for distributed computing systems", IEEE Trans. Comput. C-31 (1) (1982) 41-47.
25. C.C. Shen, W.H. Tsai, "A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion", IEEE Trans. Comput. 34 (3) (March 1985) 197-203.
26. J.B. Sinclair, "Efficient computation of optimal assignment for distributed tasks", J. Parallel Distributed Comput. 4 (1987) 342-362.
27. O.Sinnen, L. Sousa, "Communication Contention in Task Scheduling,". IEEE Trans. On Parallel and Distributed Systems, 16(6):503-515, June 2005.
28. O.Sinnen, L. Sousa and F. E. Sandnes, "Toward a Realistic Task Scheduling Model,". IEEE Trans. On Parallel and Distributed Systems, 17(3):263-275, June 2006.