Show simple item record

dc.contributor.authorDikaiakos, Marios D.en
dc.contributor.authorRogers, Anneen
dc.contributor.authorSteiglitz, Kennethen
dc.contributor.editorMadisetti Vijayen
dc.contributor.editorGelenbe Erolen
dc.contributor.editorWalrand Jeanen
dc.creatorDikaiakos, Marios D.en
dc.creatorRogers, Anneen
dc.creatorSteiglitz, Kennethen
dc.description.abstractIn this paper we extend the practical range of simulations of parallel executions by what we call 'functional algorithm simulation,' that is, simulation without actually performing most of the numerical computations involved. We achieve this by introducing a new approach for generating and collecting communication and computation characteristics for a class of parallel scientific algorithms. We describe FAST (Fast Algorithm Simulation Testbed), a prototype system that we developed to implement and test our approach. FAST overcomes some of the difficulties imposed by the very high complexity of interesting scientific algorithms, collects profile information representative of the algorithms rather than the underlying mapping strategies and hardware-design choices, and allows a performance assessment of parallel machines with various sizes and different interconnection schemes.en
dc.publisherPubl by IEEEen
dc.sourceProceedings of the IEEE International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systemsen
dc.sourceProceedings of the 2nd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systemsen
dc.subjectMathematical modelsen
dc.subjectComputer simulationen
dc.subjectComputational methodsen
dc.subjectComputer architectureen
dc.subjectComputational complexityen
dc.subjectData communication systemsen
dc.subjectNumerical methodsen
dc.subjectParallel processing systemsen
dc.subjectData structuresen
dc.subjectFunctional algorithm simulation testbeden
dc.subjectParallel computationen
dc.subjectParallel machineen
dc.subjectParallel scientific algorithmen
dc.titleFAST: a functional algorithm simulation testbeden
dc.description.endingpage146 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeConference Objecten
dc.description.notes<p>Sponsors: IEEEen
dc.description.notesConference code: 20771en
dc.description.notesCited By :9</p>en
dc.contributor.orcidDikaiakos, Marios D. [0000-0002-4350-6058]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record