Static task distribute algorithm based on task relation in LilyTask

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 28, Issue 5, 2005, Pages 892-899

  Di, Nan ^a   Wang, Tao ^a   Li, Xiao Ming ^a  

^a PEKING UNIVERSITY   (China)

Author keywords

Critical path; DAG; LilyTask; Static task scheduling; Task parallel

Indexed keywords

ALGORITHMS; COMMUNICATION; COMPUTATIONAL COMPLEXITY; ESTIMATION; GRAPH THEORY; OPTIMIZATION; SCHEDULING; TESTING;

COMMUNICATION COSTS; COMPUTATION COSTS; LILY TASK; PARALLEL PROGRAMMING; PRECOMPILE PHASE; SCHEDULING ALGORITHMS; STATIC TASK SCHEDULING; TASK PARALLEL; TASK RELATIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 20444385093     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Wang Tao, Di Nan, Shen Jian, Tang Yan. LilyTask programming model and its implementations on SMP and Cluster. In: Proceedings of International Conference on Parallel and Distributed Computing and Systems, Marine Del Rey, 2003, 301-306
2. Wang Tao, Li Xiao-Ming. LilyTask-A task-oriented parallel computation model. In: Proceedings of the 5th International Workshop on Advanced Parallel Processing Technologies, Xiamen, 2003, 157-161
3. Tang Yan. The design and implementation of LilyTask in shared memory [B. S. dissertation]. Peking University, Beijing, 2003(in Chinese)
4. Shen Jian. The design and implementation of LilyTask under distributed memory environment [B. S. dissertation]. Peking University, Beijing, 2003(in Chinese)
5. Wong A. K. Y. Yeung D. S.. An automatic software generation approach for easier distributed programming, In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, Beijing, 1996, 1553-1558
6. Hinkel R., von Puttkamer E.. Testing and debugging in real time systems-design decisions to use a distributed computer architecture in a real time application. In: Proceedings of the Euromicro Workshop on Real Time, Como Italy, 1989, 101-106
7. Shirazi B., Wang M.. Design and analysis of heuristic functions for static task distribution. In: Proceedings of the Workshop on the Future Trends of Distributed Computing Systems in the 1990s, Hong Kong, 1988, 124-131
8. van Driessche R., Roose D.. Dynamic load balancing with an improved with an improved spectral bisection algorithm. In: Proceedings of the Scalable High-Performance Computing Conference, Knoxville TN, 1994, 494-500
9. Garey M. R., Johnson D. S.. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman and Co., 1979
10. Radulescu A., van Gemund A. J. C.. Low-Cost task scheduling for distributed-memory machines. IEEE Transactions on Parallel and Distributed Systems, 2002, 13(6): 648-658
11. Palis M. A., Liou J., Wei D. S. L.. Task clustering and scheduling for distributed memory parallel architectures. IEEE Transactions on Parallel and Distributed Systems, 1996, 7(1): 46-55
12. Cormen T. H., Leiserson C. E., Rivest R. L., Stein C.. Introduction to Algorithm. Second Edition. Cambridge, MA: The MIT Press, 2001
13. Hwang J. J., Chow Y.-C., Anger F. D., Lee C.-Y. Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal on Computing, 1989, 18(2): 244-257
14. Wu M.-Y., Gajski D. D.. Hypertool: A programming aid for message-passing systems. IEEE Transactions on Parallel and Distributed Systems, 1990, 1(3): 330-343
15. Wells B. E., Carroll C. C.. An augmented approach to task allocation: Combining simulated annealing with list-based heuristics. In: Proceedings of the Euromicro Workshop on Parallel and Distributed Processing, Gran Canaria, 1993, 508-515
16. Culler D. E., Singh J. Pal, Gupta A.. Parallel Computer Architecture: A Hardware/Software Approach. Second Edition. San Francisco: Morgan Kaufmann Publishers, Inc., 1998