Author of the publication

Mapping Divide-and-Conquer Algorithms to Parallel Architectures.

, , , , , and . ICPP (3), page 128-135. Pennsylvania State University Press, (1990)0-271-00728-1.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An Efficient Heuristic for Application-Specific Routing on Mesh Connected Multicomputers., and . ICPP (3), page 216-219. CRC Press, (1992)Task Assignment to Minimize Completion Time.. ICDCS, page 329-336. IEEE Computer Society, (1985)Heuristic Algorithms for Task Assignment in Distributed Systems.. ICDCS, page 30-39. IEEE Computer Society, (1984)A theoretical framework for the multicast address allocation problem., , , and . GLOBECOM, page 2108-2112. IEEE, (2002)Cyclic Block Allocation: A New Scheme for Hierarchical Multicast Address Allocation., , , and . Networked Group Communication, volume 1736 of Lecture Notes in Computer Science, page 216-234. Springer, (1999)Parallel Divide and Conquer on Meshes., , , and . IEEE Trans. Parallel Distributed Syst., 7 (10): 1049-1058 (1996)Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers., , , and . IEEE Trans. Parallel Distributed Syst., 8 (7): 712-726 (1997)The impact of spatial layout of jobs on I/O hotspots in mesh networks., , and . J. Parallel Distributed Comput., 65 (10): 1190-1203 (2005)OREGAMI: Tools for mapping parallel computations to parallel architectures., , , , , , , and . Int. J. Parallel Program., 20 (3): 237-270 (1991)Collective Buffering: Improving Parallel I/O Performance., and . HPDC, page 148-157. IEEE Computer Society, (1997)