Show simple item record

dc.contributor.authorLor, Sam
dc.contributor.authorShen, Hong
dc.contributor.authorMaheshwari, Piyush
dc.date.accessioned2019-11-11T06:55:36Z
dc.date.available2019-11-11T06:55:36Z
dc.date.issued1997
dc.identifier.issn13837621en_US
dc.identifier.doi10.1016/S1383-7621(96)00052-5en_US
dc.identifier.urihttp://hdl.handle.net/10072/121203
dc.description.abstractMapping of parallel programs onto parallel computers for efficient execution is a fundamental problem of great significance in parallel processing. This paper describes a heuristic algorithm for mapping arbitrary parallel programs onto hypercube computers using a divide-and-conquer technique. The running time of our algorithm is O(dn3), where n is the number of tasks in the parallel program and d is the dimension of the hypercube computer. The algorithm is implemented in C + + and its performance is evaluated through extensive testing and analysis.en_US
dc.description.peerreviewedYesen_US
dc.languageEnglishen_US
dc.publisherNorth-Hollanden_US
dc.publisher.placeNetherlandsen_US
dc.relation.ispartofpagefrom373en_US
dc.relation.ispartofpageto390en_US
dc.relation.ispartofissue6-7en_US
dc.relation.ispartofjournalJournal of Systems Architectureen_US
dc.relation.ispartofvolume43en_US
dc.titleDivide-and-conquer mapping of parallel programs onto hypercube computersen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.facultyGriffith Sciences, Griffith Institute for Drug Discoveryen_US
gro.hasfulltextNo Full Text
gro.griffith.authorLor, Sam
gro.griffith.authorShen, Hong
gro.griffith.authorMaheshwari, Piyush


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record