| dc.contributor.author |
Mishra, Abhishek |
|
| dc.date.accessioned |
2024-05-06T09:02:34Z |
|
| dc.date.available |
2024-05-06T09:02:34Z |
|
| dc.date.issued |
2010-10 |
|
| dc.identifier.uri |
https://ischolar.sscldl.in/index.php/IJCSIT/article/view/138296 |
|
| dc.identifier.uri |
http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14731 |
|
| dc.description.abstract |
In this paper, we have developed a heuristic for the task allocation problem on a fully connected homogeneous multiprocessor environment. Our heuristic is based on a value associated with the modules called the Computation-Communication-Load (CCLoad). This value is dependent on the computation and the communication times associated with the module. Using the concept of CCLoad, we propose a clustering algorithm of complexity O(|V|2(|V|+|E|)log(|V|+|E|)), and demonstrate its superiority over a generic version of Sarkar's algorithm. |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
AIRCC |
en_US |
| dc.subject |
Computer Science |
en_US |
| dc.subject |
Clustering |
en_US |
| dc.subject |
Distributed Computing |
en_US |
| dc.subject |
Homogeneous Systems |
en_US |
| dc.subject |
Task Allocation |
en_US |
| dc.title |
A Clustering Heuristic for Multiprocessor Environments Using Computation and Communication Loads of Modules |
en_US |
| dc.type |
Article |
en_US |