A message ordering problem in parallel programs

Simple item page
buir.contributor.authorAykanat, Cevdet
dc.citation.epage138en_US
dc.citation.spage131en_US
dc.citation.volumeNumber3241en_US
dc.contributor.authorUçar, B.en_US
dc.contributor.authorAykanat, Cevdeten_US
dc.date.accessioned2016-02-08T10:24:54Z
dc.date.available2016-02-08T10:24:54Zen_US
dc.date.issued2004en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractWe consider a certain class of parallel program segments in which the order of messages sent affects the completion time. We give characterization of these parallel program segments and propose a solution to minimize the completion time. With a sample parallel program, we experimentally evaluate the effect of the solution on a PC cluster. © Springer-Verlag 2004.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:24:54Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2004en_US
dc.identifier.doi10.1007/978-3-540-30218-6_23en_US
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.urihttp://hdl.handle.net/11693/24154en_US
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttps://doi.org/10.1007/978-3-540-30218-6_23en_US
dc.source.titleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_US
dc.subjectParallel programmingen_US
dc.subjectCompletion timeen_US
dc.subjectMessage orderingen_US
dc.subjectParallel programen_US
dc.subjectPC clustersen_US
dc.subjectMessage passingen_US
dc.titleA message ordering problem in parallel programsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A message ordering problem in parallel programs.pdf
Size:
220.65 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Computer Engineering