skip to content
Comparison study of heuristics for mapping parallel algorithms to message-passing multiprocessors Preview this item
ClosePreview this item
Checking...

Comparison study of heuristics for mapping parallel algorithms to message-passing multiprocessors

Author: Marios D Dikaiakos; Anne Rogers; Kenneth Steiglitz
Publisher: Princeton, N.J. : Princeton University, Dept. of Computer Science, [1994]
Series: Princeton University.; Department of Computer Science.; Research report
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "This paper presents a comparison study of popular clustering and mapping heuristics which are used to map task-flow graphs to message-passing multiprocessors. To this end, we use task-graphs which are representative of important scientific algorithms running on data-sets of practical interest. The annotation which assigns weights to nodes and edges of the task-graphs is realistic. It reflects current  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Marios D Dikaiakos; Anne Rogers; Kenneth Steiglitz
OCLC Number: 32810708
Notes: "February 1994."
Description: 18 pages : illustrations ; 28 cm.
Series Title: Princeton University.; Department of Computer Science.; Research report
Responsibility: Marios D. Dikaiakos, Anne Rogers, Ken Steiglitz.

Abstract:

Abstract: "This paper presents a comparison study of popular clustering and mapping heuristics which are used to map task-flow graphs to message-passing multiprocessors. To this end, we use task-graphs which are representative of important scientific algorithms running on data-sets of practical interest. The annotation which assigns weights to nodes and edges of the task-graphs is realistic. It reflects current trends in processor, communication channel, and message-passing interface technology and takes into consideration hardware characteristics of state-of-the-art multiprocessors. Our experiments show that applying realistic models for task-graph annotation affects the effectiveness and functionality of clustering and mapping techniques. Therefore, new heuristics are necessary that will take into account more practical models of communication costs. We present modifications to existing clustering and mapping algorithms which improve their efficiency and running-time for the practical models adopted."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/32810708>
library:oclcnum"32810708"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/32810708>
rdf:typeschema:Book
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1994"
schema:description"Abstract: "This paper presents a comparison study of popular clustering and mapping heuristics which are used to map task-flow graphs to message-passing multiprocessors. To this end, we use task-graphs which are representative of important scientific algorithms running on data-sets of practical interest. The annotation which assigns weights to nodes and edges of the task-graphs is realistic. It reflects current trends in processor, communication channel, and message-passing interface technology and takes into consideration hardware characteristics of state-of-the-art multiprocessors. Our experiments show that applying realistic models for task-graph annotation affects the effectiveness and functionality of clustering and mapping techniques. Therefore, new heuristics are necessary that will take into account more practical models of communication costs. We present modifications to existing clustering and mapping algorithms which improve their efficiency and running-time for the practical models adopted.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/36496381>
schema:inLanguage"en"
schema:name"Comparison study of heuristics for mapping parallel algorithms to message-passing multiprocessors"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.