๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient heuristic algorithm for mapping parallel programs onto multicomputers

โœ Scribed by S. Selvakumar; C. Siva Ram Murthy

Publisher
Elsevier Science
Year
1993
Weight
743 KB
Volume
36
Category
Article
ISSN
0165-6074

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient algorithm for mapping VLSI
An efficient algorithm for mapping VLSI circuit simulation programs onto multiprocessors
โœ S. Selvakumar; C. Siva Ram Murthy ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 405 KB

Recent advances in VLSI and communications technology have made the use of multiprocessors m circuit simulation cost-effective\_ However, for achieving maximum speedup in concurrent circuit simulation, the problem of mapping the tasks of a concurrent program onto the processors of a muitiprocessor m

An efficient clustering algorithm for pa
An efficient clustering algorithm for partitioning parallel programs
โœ Piyush Maheshwari; Hong Shen ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 254 KB

This paper presents a clustering algorithm that partitions node-labelled and edge-labelled ลฝ . directed acyclic precedence graphs APG into clusters such that all the clusters have balanced amount of computation load and there is only one communication path between any pair of clusters. The algorithm