IEEE Trans. Parallel Distributed Syst.最新文献_第3页

Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks 环面网络中所有最小路径的自适应无死锁和无活锁路由

IEEE Trans. Parallel Distributed Syst. Pub Date : 1992-06-01 DOI: 10.1145/140901.140902

L. Gravano, G. Pifarré, P. E. Berman, J. Sanz

{"title":"Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks","authors":"L. Gravano, G. Pifarré, P. E. Berman, J. Sanz","doi":"10.1145/140901.140902","DOIUrl":"https://doi.org/10.1145/140901.140902","url":null,"abstract":"This paper consists of two parts. In the first part, two new algorithms for deadlock- and livelock-free wormhole routing in the torus network are presented. The first algorithm, called Channels, is for the n-dimensional torus network. This technique is fully-adaptive minimal, that is, all paths with a minimal number of hops from source to destination are available for routing, and needs only five virtual channels per bidirectional link, the lowest channel requirement known in the literature for fully-adaptive minimal worm-hole routing. In addition, this result also yields the lowest buffer requirement known in the literature for packet-switched fully-adaptive minimal routing. The second algorithm, called 4-Classes, is for the bidimensional torus network. This technique is fully-adaptive minimal and requires only eight virtual channels per bidirectional link. Also, it allows for a highly parallel implementation of its associated routing node. In the second part of this paper, four worm-hole routing techniques for the two-dimensional torus are experimentally evaluated using a dynamic message injection model and different traffic patterns and message lengths. >","PeriodicalId":13128,"journal":{"name":"IEEE Trans. Parallel Distributed Syst.","volume":"54 1","pages":"1233-1251"},"PeriodicalIF":0.0,"publicationDate":"1992-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79583325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 168

Guest Editors' Introduction 特邀编辑介绍

IEEE Trans. Parallel Distributed Syst. Pub Date : 1992-01-01 DOI: 10.1109/TPDS.1992.10003

R. Iyer, Kishor S. Trivedi

引用次数: 0

Editor's Notice 编辑的通知

IEEE Trans. Parallel Distributed Syst. Pub Date : 1992-01-01 DOI: 10.1109/TPDS.1992.10000

T. Feng

引用次数: 5

Correction to "A Processor-Time-Minimal Systolic Array for Cubical Mesh Algorithms" 对“立方体网格算法的处理器时间最小收缩阵列”的修正

IEEE Trans. Parallel Distributed Syst. Pub Date : 1992-01-01 DOI: 10.1109/TPDS.1992.10001

P. Cappello

引用次数: 0

Lock-free garbage collection for multiprocessors 多处理器的无锁垃圾收集

IEEE Trans. Parallel Distributed Syst. Pub Date : 1991-06-01 DOI: 10.1145/113379.113400

M. Herlihy, J. Moss

引用次数: 76

Removal of redundant dependences in DOACROSS loops with constant dependences 去除带有常量依赖的DOACROSS循环中的冗余依赖

IEEE Trans. Parallel Distributed Syst. Pub Date : 1991-04-01 DOI: 10.1145/109625.109632

V. P. Krothapalli, P. Sadayappan

引用次数: 36

Guest Editor's Introduction 特邀编辑简介

IEEE Trans. Parallel Distributed Syst. Pub Date : 1991-01-01 DOI: 10.1109/TPDS.1991.10001

D. Padua, B. Wah, P. Yew

引用次数: 0

Lazy task creation: a technique for increasing the granularity of parallel programs 惰性任务创建:一种增加并行程序粒度的技术

IEEE Trans. Parallel Distributed Syst. Pub Date : 1990-05-01 DOI: 10.1145/91556.91631

Eric Mohr, D. Kranz, Robert H. Halstead

{"title":"Lazy task creation: a technique for increasing the granularity of parallel programs","authors":"Eric Mohr, D. Kranz, Robert H. Halstead","doi":"10.1145/91556.91631","DOIUrl":"https://doi.org/10.1145/91556.91631","url":null,"abstract":"Many parallel algorithms are naturally expressed at a fine level of granularity, often finer than a MIMD parallel system can exploit efficiently. Most builders of parallel systems have looked to either the programmer or a parallelizing compiler to increase the granularity of such algorithms. In this paper we explore a third approach to the granularity problem by analyzing two strategies for combining parallel tasks dynamically at run-time. We reject the simpler load-based inlining method, where tasks are combined based on dynamic load level, in favor of the safer and more robust lazy task creation method, where tasks are created only retroactively as processing resources become available.\u0000These strategies grew out of work on Mul-T [14], an efficient parallel implementation of Scheme, but could be used with other applicative languages as well. We describe our Mul-T implementations of lazy task creation for two contrasting machines, and present performance statistics which show the method's effectiveness. Lazy task creation allows efficient execution of naturally expressed algorithms of a substantially finer grain than possible with previous parallel Lisp systems.","PeriodicalId":13128,"journal":{"name":"IEEE Trans. Parallel Distributed Syst.","volume":"7 1","pages":"264-280"},"PeriodicalIF":0.0,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81147031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 475

Foreword to the First Issue of the Transactions on Parallel and Distributed Systems 《并行与分布式系统学报》第一期前言

IEEE Trans. Parallel Distributed Syst. Pub Date : 1900-01-01 DOI: 10.1109/TPDS.1990.10000

H. Wood

引用次数: 26