Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)最新文献_第6页

Integrated VLSI layout compaction and wire balancing on a shared memory multiprocessor: evaluation of a parallel algorithm 共享内存多处理器上集成VLSI布局压缩和线路平衡:一种并行算法的评估

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) Pub Date : 1994-12-14 DOI: 10.1109/ISPAN.1994.367165

P. Chalasani, K. Thulasiraman, M. Corneau

{"title":"Integrated VLSI layout compaction and wire balancing on a shared memory multiprocessor: evaluation of a parallel algorithm","authors":"P. Chalasani, K. Thulasiraman, M. Corneau","doi":"10.1109/ISPAN.1994.367165","DOIUrl":"https://doi.org/10.1109/ISPAN.1994.367165","url":null,"abstract":"We first present a unified formulation to three problems in VLSI physical design: layout compaction, wire balancing and integrated layout compaction and wire balancing problem. The aim of layout compaction is to achieve minimum chip width. Whereas wire balancing seeks to achieve minimum total wire length, integrated layout compaction and wire balancing seeks to minimize wire length maintaining the chip width at the optimum value. Our formulation is in terms of the dual transshipment problem. We then review our recent work on a parallel algorithm for the dual transshipment problem. We show how this algorithm called Modified Network Dual Simplex Method provides a unified approach to solve the three problems mentioned above and present experimental results. Our implementations have been on the BBN Butterfly machine. We draw attention to certain rather unusual results and argue that if the MNDS method is used then integrated layout compaction and wire balancing will achieve minimum chip width and a total wire length close to the optimum achieved by the wire balancing algorithm.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131752602","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}

引用次数: 2

Software pipelining for Jetpipeline architecture Jetpipeline架构的软件流水线

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) Pub Date : 1994-12-14 DOI: 10.1109/ISPAN.1994.367155

M. Katahira, Takehito Sasaki, Hong Shen, Hiroaki Kobayashi, Tadao Nakamura

{"title":"Software pipelining for Jetpipeline architecture","authors":"M. Katahira, Takehito Sasaki, Hong Shen, Hiroaki Kobayashi, Tadao Nakamura","doi":"10.1109/ISPAN.1994.367155","DOIUrl":"https://doi.org/10.1109/ISPAN.1994.367155","url":null,"abstract":"High performance processors based on pipeline processing play an important role in scientific computation. We have proposed a hybrid pipeline architecture named Jetpipeline in our former work. The concept of Jetpipeline comes from the integration of superscalar, VLIW and vector architectures. Jetpipeline has multiple instruction pipelines, which execute multiple instructions like superscalar architectures. Instructions to be executed simultaneously are statically scheduled by a compiler like VLIW architectures. Therefore, parallelism derivation and instruction scheduling are very important for Jetpipeline. Software pipelining is one of the well-known techniques to achieve high throughput when processing loop programs. In this paper, we propose software pipelining for Jetpipeline. Firstly, the overview of the Jetpipeline architecture is described. Then the banked register configuration of Jetpipeline for reducing hardware complexity and supporting software pipelining is presented. Finally, the effectiveness of software pipelining for Jetpipeline is discussed by simulation.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129016335","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}

引用次数: 2

Quicksort and permutation routing on the hypercube and de Bruijn networks 超立方体和de Bruijn网络上的快速排序和排列路由

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) Pub Date : 1994-12-14 DOI: 10.1109/ISPAN.1994.367189

David S. L. Wei

{"title":"Quicksort and permutation routing on the hypercube and de Bruijn networks","authors":"David S. L. Wei","doi":"10.1109/ISPAN.1994.367189","DOIUrl":"https://doi.org/10.1109/ISPAN.1994.367189","url":null,"abstract":"We consider the problems of sorting and routing on some unbounded interconnection networks, namely hypercube and de Bruijn network. We first present two efficient implementations of quicksort on the hypercube. The first algorithm sorts N items on an N-node hypercube, one item per node, in O((log/sup 2/ N)/(log log N)) time with high probability, while the other one sorts N items on an (N/log N)-node hypercube, log N items per node, in O(log/sup 2/ N) time with high probability, which achieves optimal speedup in the sense of PT product. Both algorithms beat the fastest previous quicksort that runs in O(log/sup 2/ N) expected time on a butterfly of N nodes. We also present a deterministic (nonoblivious) permutation routing algorithm which runs in O(d/spl middot/n/sup 2/) time on a d-ary de Bruijn network of N=d/sup n/ nodes. To the best of our knowledge, this routing algorithm is so far the fastest deterministic one for the de Bruijn network of arbitrary degree. The best previous one runs in O((log d)/spl middot/d/spl middot/n/sup 2/) time. All algorithms presented are simple, the constants hidden behind the big Oh being small.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134607107","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}

引用次数: 3

Views of mixed-mode computing and network evaluation 混合模式计算与网络评估的观点

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) Pub Date : 1994-12-14 DOI: 10.1109/ISPAN.1994.367171

H. Siegel, J. Antonio

引用次数: 4

Increase analysis in the total execution time of a parallel program 增加对并行程序总执行时间的分析

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) Pub Date : 1994-12-14 DOI: 10.1109/ISPAN.1994.367175

Dingchao Li, Hiromitsu Takagi, N. Ishii

引用次数: 0

Organization of a parallel virtual machine 并行虚拟机的组织

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) Pub Date : 1994-12-14 DOI: 10.1109/ISPAN.1994.367137

V. Beletsky, T. Popova, A. Chemeris

引用次数: 0

A systolic array implementation of common factor algorithm to compute DFT 一个收缩阵列实现的公因子算法来计算DFT

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN) Pub Date : 1994-12-14 DOI: 10.1109/ISPAN.1994.367177

S. He, M. Torkelson

引用次数: 15