schliessen

Filtern

 

Bibliotheken

Cover Image

An adaptive and cost-optimal parallel algorithm for minimum spanning trees

Byline: S. G. Akl (1) Keywords: B.3.2 [Memory Structures]: Design Styles -- shared memory; C.1.2 [Computer System Organization]: Multiple Data Stream Architectures (Multi-processors) -- single-instruction-stream, multiple-data-stream processors (SIMD); F.1.2 [Computation by Devices]: Modes of Comput... Full description

Journal Title: Computing 1986, Vol.36 (3), p.271-277
Main Author: AKL, S. G
Format: Electronic Article Electronic Article
Language: English
Subjects:
Algorithmics. Computability. Computer arithmetics
Algorithms
Analysis
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Theoretical computing
Publisher: Wien: Springer
ID: ISSN: 0010-485X
Link: http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=7942432
Zum Text:
SendSend as email Add to Book BagAdd to Book Bag
Staff View
recordid: cdi_gale_infotracacademiconefile_A153918049
title: An adaptive and cost-optimal parallel algorithm for minimum spanning trees
format: Article
creator:
  • AKL, S. G
subjects:
  • Algorithmics. Computability. Computer arithmetics
  • Algorithms
  • Analysis
  • Applied sciences
  • Computer science
  • control theory
  • systems
  • Exact sciences and technology
  • Theoretical computing
ispartof: Computing, 1986, Vol.36 (3), p.271-277
description: Byline: S. G. Akl (1) Keywords: B.3.2 [Memory Structures]: Design Styles -- shared memory; C.1.2 [Computer System Organization]: Multiple Data Stream Architectures (Multi-processors) -- single-instruction-stream, multiple-data-stream processors (SIMD); F.1.2 [Computation by Devices]: Modes of Computation -- parallelism; F.2.2, F.2.3 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems -- computations on discrete structures; Tradeoffs among Complexity Measures; G.2.2 [Discrete Mathematics]: Graph Theory -- graph algorithms, trees; Algorithms; Adaptive algorithm; cost-optimal algorithm; minimum spanning tree; parallel algorithm A parallel algorithm is described for computing the minimum spanning tree of an undirected, connected and weighted graph withn vertices. We assume a shared-memory single-instruction-stream, multiple-data-stream model of computation which does not allow read or write conflicts. The algorithm is adaptive in the sense that it usesn .sup.1-e processors and runs inO(n .sup.1+e) time wheree lies between 0 and 1 and depends on the number of available processors. In view of the obvious [OMEGA](n .sup.2) lower bound on the number of operations required to compute a minimum spanning tree, the algorithm is also cost-optimal. (German): Wir beschreiben einen Parallel-Algorithmus, der ein Minimalgerust fur einen ungerichteten, zusammenhangenden bewerteten Graphen mitn-Knoten ermittelt. Das zugrunde liegende Rechnermodell ist ein Mehrprozessorsystem mit gemeinsamem Speicher, das vielfachen Datentransfer erlaubt und von einer einzigen Zentraleinheit kontrolliert wird. Lese- oder Schreibkonflikte des Systems sollen ausgeschlossen sein. -- Der Algorithmus passt sich an die Zahl der verfugbaren Prozessoren an. Mitn .sup.1-e-Prozessoren lauft er in der ZeitO(n .sup.1+e), wobeie zwischen null und eins liegt. Der Algorithmus ist kostenoptimal, da die Berechnung des Minimalgerusts [OMEGA](n .sup.2) Operationen benotigt. Author Affiliation: (1) Department of Computing and Information Science, Queen's University, Kingston, Ontario, Canada Article History: Registration Date: 18/10/2005 Received Date: 21/01/1985 Article note: This work was supported by the Natural Sciences and Engineering Research Council of Canada under grant NSERC-A3336 (Technical Report No. 85-164).
language: eng
source:
identifier: ISSN: 0010-485X
fulltext: no_fulltext
issn:
  • 0010-485X
  • 1436-5057
url: Link


@attributes
NO1
SEARCH_ENGINEprimo_central_multiple_fe
SEARCH_ENGINE_TYPEPrimo Central Search Engine
RANK1.4327408
LOCALfalse
PrimoNMBib
record
control
sourceidgale_cross
recordidTN_cdi_gale_infotracacademiconefile_A153918049
sourceformatXML
sourcesystemPC
galeidA153918049
sourcerecordidA153918049
originalsourceidFETCH-LOGICAL-c248t-2ba82cae1f7c646e0a429674815a900b6a1b38c0cd8e0f2ea58c1285870e591f0
addsrcrecordideNpFkEtLxDAUhYMoOI5u_AVZuBI63qRJmy7HwfHBgBsFd-VOmoyRNClJFfz3UxlR7uI-ON-Bewi5ZLBgAPXN7Ro4F9NUHpEZE2VVSJD1MZkBMCiEkm-n5CznDwDgpWpm5GkZKHY4jO7LUAwd1TGPRZz2Hj0dMKH3xlP0u5jc-N5TGxPtXXD9Z0_zgCG4sKNjMiafkxOLPpuL3z4nr-u7l9VDsXm-f1wtN4XmQo0F36LiGg2zta5EZQAFb6paKCaxAdhWyLal0qA7ZcByg1JpxpVUNRjZMAtzsjj47tCb1gUbx4R6qs70TsdgrJvuSybLhikQzQRcHwCdYs7J2HZI03vpu2XQ_sTW_sc2ia8O4gGzRm8TBu3yH1E3gouSwx7dRWuJ
sourcetypeAggregation Database
isCDItrue
recordtypearticle
display
typearticle
titleAn adaptive and cost-optimal parallel algorithm for minimum spanning trees
creatorAKL, S. G
creatorcontribAKL, S. G
descriptionByline: S. G. Akl (1) Keywords: B.3.2 [Memory Structures]: Design Styles -- shared memory; C.1.2 [Computer System Organization]: Multiple Data Stream Architectures (Multi-processors) -- single-instruction-stream, multiple-data-stream processors (SIMD); F.1.2 [Computation by Devices]: Modes of Computation -- parallelism; F.2.2, F.2.3 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems -- computations on discrete structures; Tradeoffs among Complexity Measures; G.2.2 [Discrete Mathematics]: Graph Theory -- graph algorithms, trees; Algorithms; Adaptive algorithm; cost-optimal algorithm; minimum spanning tree; parallel algorithm A parallel algorithm is described for computing the minimum spanning tree of an undirected, connected and weighted graph withn vertices. We assume a shared-memory single-instruction-stream, multiple-data-stream model of computation which does not allow read or write conflicts. The algorithm is adaptive in the sense that it usesn .sup.1-e processors and runs inO(n .sup.1+e) time wheree lies between 0 and 1 and depends on the number of available processors. In view of the obvious [OMEGA](n .sup.2) lower bound on the number of operations required to compute a minimum spanning tree, the algorithm is also cost-optimal. (German): Wir beschreiben einen Parallel-Algorithmus, der ein Minimalgerust fur einen ungerichteten, zusammenhangenden bewerteten Graphen mitn-Knoten ermittelt. Das zugrunde liegende Rechnermodell ist ein Mehrprozessorsystem mit gemeinsamem Speicher, das vielfachen Datentransfer erlaubt und von einer einzigen Zentraleinheit kontrolliert wird. Lese- oder Schreibkonflikte des Systems sollen ausgeschlossen sein. -- Der Algorithmus passt sich an die Zahl der verfugbaren Prozessoren an. Mitn .sup.1-e-Prozessoren lauft er in der ZeitO(n .sup.1+e), wobeie zwischen null und eins liegt. Der Algorithmus ist kostenoptimal, da die Berechnung des Minimalgerusts [OMEGA](n .sup.2) Operationen benotigt. Author Affiliation: (1) Department of Computing and Information Science, Queen's University, Kingston, Ontario, Canada Article History: Registration Date: 18/10/2005 Received Date: 21/01/1985 Article note: This work was supported by the Natural Sciences and Engineering Research Council of Canada under grant NSERC-A3336 (Technical Report No. 85-164).
identifier
0ISSN: 0010-485X
1EISSN: 1436-5057
2DOI: 10.1007/BF02240073
3CODEN: CMPTA2
languageeng
publisherWien: Springer
subjectAlgorithmics. Computability. Computer arithmetics ; Algorithms ; Analysis ; Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Theoretical computing
ispartofComputing, 1986, Vol.36 (3), p.271-277
rights
01987 INIST-CNRS
1COPYRIGHT 1986 Springer
lds50peer_reviewed
citesFETCH-LOGICAL-c248t-2ba82cae1f7c646e0a429674815a900b6a1b38c0cd8e0f2ea58c1285870e591f0
links
openurl$$Topenurl_article
thumbnail$$Usyndetics_thumb_exl
backlink$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=7942432$$DView record in Pascal Francis
search
creatorcontribAKL, S. G
title
0An adaptive and cost-optimal parallel algorithm for minimum spanning trees
1Computing
descriptionByline: S. G. Akl (1) Keywords: B.3.2 [Memory Structures]: Design Styles -- shared memory; C.1.2 [Computer System Organization]: Multiple Data Stream Architectures (Multi-processors) -- single-instruction-stream, multiple-data-stream processors (SIMD); F.1.2 [Computation by Devices]: Modes of Computation -- parallelism; F.2.2, F.2.3 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems -- computations on discrete structures; Tradeoffs among Complexity Measures; G.2.2 [Discrete Mathematics]: Graph Theory -- graph algorithms, trees; Algorithms; Adaptive algorithm; cost-optimal algorithm; minimum spanning tree; parallel algorithm A parallel algorithm is described for computing the minimum spanning tree of an undirected, connected and weighted graph withn vertices. We assume a shared-memory single-instruction-stream, multiple-data-stream model of computation which does not allow read or write conflicts. The algorithm is adaptive in the sense that it usesn .sup.1-e processors and runs inO(n .sup.1+e) time wheree lies between 0 and 1 and depends on the number of available processors. In view of the obvious [OMEGA](n .sup.2) lower bound on the number of operations required to compute a minimum spanning tree, the algorithm is also cost-optimal. (German): Wir beschreiben einen Parallel-Algorithmus, der ein Minimalgerust fur einen ungerichteten, zusammenhangenden bewerteten Graphen mitn-Knoten ermittelt. Das zugrunde liegende Rechnermodell ist ein Mehrprozessorsystem mit gemeinsamem Speicher, das vielfachen Datentransfer erlaubt und von einer einzigen Zentraleinheit kontrolliert wird. Lese- oder Schreibkonflikte des Systems sollen ausgeschlossen sein. -- Der Algorithmus passt sich an die Zahl der verfugbaren Prozessoren an. Mitn .sup.1-e-Prozessoren lauft er in der ZeitO(n .sup.1+e), wobeie zwischen null und eins liegt. Der Algorithmus ist kostenoptimal, da die Berechnung des Minimalgerusts [OMEGA](n .sup.2) Operationen benotigt. Author Affiliation: (1) Department of Computing and Information Science, Queen's University, Kingston, Ontario, Canada Article History: Registration Date: 18/10/2005 Received Date: 21/01/1985 Article note: This work was supported by the Natural Sciences and Engineering Research Council of Canada under grant NSERC-A3336 (Technical Report No. 85-164).
subject
0Algorithmics. Computability. Computer arithmetics
1Algorithms
2Analysis
3Applied sciences
4Computer science; control theory; systems
5Exact sciences and technology
6Theoretical computing
issn
00010-485X
11436-5057
fulltextfalse
rsrctypearticle
creationdate1986
recordtypearticle
recordideNpFkEtLxDAUhYMoOI5u_AVZuBI63qRJmy7HwfHBgBsFd-VOmoyRNClJFfz3UxlR7uI-ON-Bewi5ZLBgAPXN7Ro4F9NUHpEZE2VVSJD1MZkBMCiEkm-n5CznDwDgpWpm5GkZKHY4jO7LUAwd1TGPRZz2Hj0dMKH3xlP0u5jc-N5TGxPtXXD9Z0_zgCG4sKNjMiafkxOLPpuL3z4nr-u7l9VDsXm-f1wtN4XmQo0F36LiGg2zta5EZQAFb6paKCaxAdhWyLal0qA7ZcByg1JpxpVUNRjZMAtzsjj47tCb1gUbx4R6qs70TsdgrJvuSybLhikQzQRcHwCdYs7J2HZI03vpu2XQ_sTW_sc2ia8O4gGzRm8TBu3yH1E3gouSwx7dRWuJ
startdate1986
enddate1986
creatorAKL, S. G
generalSpringer
scope
0IQODW
1AAYXX
2CITATION
3BSHEE
sort
creationdate1986
titleAn adaptive and cost-optimal parallel algorithm for minimum spanning trees
authorAKL, S. G
facets
frbrtype5
frbrgroupidcdi_FETCH-LOGICAL-c248t-2ba82cae1f7c646e0a429674815a900b6a1b38c0cd8e0f2ea58c1285870e591f0
rsrctypearticles
prefilterarticles
languageeng
creationdate1986
topic
0Algorithmics. Computability. Computer arithmetics
1Algorithms
2Analysis
3Applied sciences
4Computer science; control theory; systems
5Exact sciences and technology
6Theoretical computing
toplevelpeer_reviewed
creatorcontribAKL, S. G
collection
0Pascal-Francis
1CrossRef
2Academic OneFile (A&I only)
jtitleComputing
delivery
delcategoryRemote Search Resource
fulltextno_fulltext
addata
auAKL, S. G
formatjournal
genrearticle
ristypeJOUR
atitleAn adaptive and cost-optimal parallel algorithm for minimum spanning trees
jtitleComputing
date1986
risdate1986
volume36
issue3
spage271
epage277
pages271-277
issn0010-485X
eissn1436-5057
codenCMPTA2
abstractByline: S. G. Akl (1) Keywords: B.3.2 [Memory Structures]: Design Styles -- shared memory; C.1.2 [Computer System Organization]: Multiple Data Stream Architectures (Multi-processors) -- single-instruction-stream, multiple-data-stream processors (SIMD); F.1.2 [Computation by Devices]: Modes of Computation -- parallelism; F.2.2, F.2.3 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems -- computations on discrete structures; Tradeoffs among Complexity Measures; G.2.2 [Discrete Mathematics]: Graph Theory -- graph algorithms, trees; Algorithms; Adaptive algorithm; cost-optimal algorithm; minimum spanning tree; parallel algorithm A parallel algorithm is described for computing the minimum spanning tree of an undirected, connected and weighted graph withn vertices. We assume a shared-memory single-instruction-stream, multiple-data-stream model of computation which does not allow read or write conflicts. The algorithm is adaptive in the sense that it usesn .sup.1-e processors and runs inO(n .sup.1+e) time wheree lies between 0 and 1 and depends on the number of available processors. In view of the obvious [OMEGA](n .sup.2) lower bound on the number of operations required to compute a minimum spanning tree, the algorithm is also cost-optimal. (German): Wir beschreiben einen Parallel-Algorithmus, der ein Minimalgerust fur einen ungerichteten, zusammenhangenden bewerteten Graphen mitn-Knoten ermittelt. Das zugrunde liegende Rechnermodell ist ein Mehrprozessorsystem mit gemeinsamem Speicher, das vielfachen Datentransfer erlaubt und von einer einzigen Zentraleinheit kontrolliert wird. Lese- oder Schreibkonflikte des Systems sollen ausgeschlossen sein. -- Der Algorithmus passt sich an die Zahl der verfugbaren Prozessoren an. Mitn .sup.1-e-Prozessoren lauft er in der ZeitO(n .sup.1+e), wobeie zwischen null und eins liegt. Der Algorithmus ist kostenoptimal, da die Berechnung des Minimalgerusts [OMEGA](n .sup.2) Operationen benotigt. Author Affiliation: (1) Department of Computing and Information Science, Queen's University, Kingston, Ontario, Canada Article History: Registration Date: 18/10/2005 Received Date: 21/01/1985 Article note: This work was supported by the Natural Sciences and Engineering Research Council of Canada under grant NSERC-A3336 (Technical Report No. 85-164).
copWien
pubSpringer
doi10.1007/BF02240073