Aligned multithreaded computations and their scheduling with performance guarantees

Parallel Processing Letters

Volumn 13, Issue 3, 2003, Pages 353-364

  Xie, Yong ^a   Hsu, Wen Jing ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Arbitrary task graphs; Efficient execution strategies; Multithreaded programming model

Indexed keywords

ARBITRARY TASK GRAPHS; EFFICIENT EXECUTION STRATEGIES; MULTITHREADED PROGRAMMING MODELS;

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; GRAPH THEORY; MATHEMATICAL MODELS; PROGRAM PROCESSORS; SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 0348158236     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626403001331     Document Type: Article

References (10)

1. R. D. Blumofe, Executing multithreaded programs efficiently, Tech. Report MIT/LCS/TR-677, 1995.
2. R. D. Blumofe and Charles E. Leiserson, Space-efficient scheduling of multithreaded computations, 1993, pp. 362-371.
3. P. W. Burton and M. R. Sleep, Executing functional programs on a virtual tree of processors, Proceedings of the 1981 conference on Functional programming languages and computer architecture, 1981, pp. 187-194.
4. D. E. Culler, A. Sah, K. E. Schauser, T. von Eicken, and J. Wawrzynek, Fine-grain parallelism with minimal hardware support: A compiler-controlled threaded abstract machine, Proceedings of the4th International Conference on Architectural Support for Programming Languages and Operating Systems, 1991, pp. 164-175.
5. C. Kaklamanis and G. Persiano, Branch-and-bound and backtrack search on mesh-connected arrays of processors, ACM Symposium on Parallel Algorithms and Architectures, 1992, pp. 118-126.
6. T. Leighton, M. Newman, A. G. Ranade, and E. Schwabe, Dynamic tree embeddings in butterflies and hypercubes, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, ACM Press, 1989, pp. 224-234.
7. A. Gupta, R. Chandra and J. L. Hennessy, Cool: An object-based language for parallel programming, IEEE Computer, 1994, pp. 13-26.
8. R. Feldmann, P. Mysliwietz, and B. Monien, Game tree search on a massively parallel system, Advances in Computer Chess 7, pp. 203-219, 1993.
9. Y. Xie, Excuting Mulithreaded Programs Efficiently on Grid, Undergraduate thesis, School of Computer Engineering, Nanyang Technological University, 2002.
10. Y. J. Zhang, Parallel algorithms for combinatorial search problems, Ph.D. dissertation, Department of Electric Engineering and Computer Science, University of California at Berkeley, November 1989.