Skip to main navigation Skip to search Skip to main content

Parallelization of Lee’s routing algorithm on a hypercube multicomputer

  • Bilkent University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Lee’s maze routing algorithm is parallelized and implemented on an Intel iPSC/2 hypercube multicomputer. Our contribution to the previous work in [2] is that we propose a new parallel front wave expansion scheme which performs two front wave expansions concurrently, one starting from the source cell and the other one starting from the target cell. The proposed scheme increases the processor utilization and decreases the total number of interprocessor communications. We experimentally show that our scheme outperforms the scheme given in[2].

Original languageEnglish
Title of host publicationDistributed Memory Computing - 2nd European Conference, EDMCC2, Proceedings
EditorsArndt Bode
PublisherSpringer Verlag
Pages244-253
Number of pages10
ISBN (Print)9783540539513
DOIs
StatePublished - 1991
Event2nd European Distributed Memory Computing Conference, EDMCC 1991 - Munich, Germany
Duration: Apr 22 1991Apr 24 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume487 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd European Distributed Memory Computing Conference, EDMCC 1991
Country/TerritoryGermany
CityMunich
Period04/22/9104/24/91

Fingerprint

Dive into the research topics of 'Parallelization of Lee’s routing algorithm on a hypercube multicomputer'. Together they form a unique fingerprint.

Cite this