ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Task assignment in a multiprocessor system

Murthy, Siva Ram C and Rajaraman, V (1989) Task assignment in a multiprocessor system. In: Microprocessing and Microprogramming, 26 (1). 63 -71.

Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1016/0165-6074(89)90282-2

Abstract

One of the key problems in the design of any incompletely connected multiprocessor system is to appropriately assign the set of tasks in a program to the Processing Elements (PEs) in the system. The task assignment problem has proven difficult both in theory and in practice. This paper presents a simple and efficient heuristic algorithm for assigning program tasks with precedence and communication constraints to the PEs in a Message-based Multiple-bus Multiprocessor System, M3, so that the total execution time for the program is minimized. The algorithm uses a cost function: “Minimum Distance and Parallel Transfer” to minimize the completion time. The effectiveness of the algorithm has been demonstrated by comparing the results with (i) the lower bound on the execution time of a program (task) graph and (ii) a random assignment.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Elsevier Science.
Keywords: Multiprocessor system;Task graph;Task assignment;Heuristics.
Department/Centre: Division of Information Sciences > Supercomputer Education & Research Centre
Date Deposited: 19 Aug 2010 12:32
Last Modified: 19 Aug 2010 12:32
URI: http://eprints.iisc.ernet.in/id/eprint/31472

Actions (login required)

View Item View Item