Int. J. High Speed Comput.最新文献_第10页

On Improving the Performance of Tree Machines 关于提高树机性能的研究

Int. J. High Speed Comput. Pub Date : 1995-06-01 DOI: 10.1142/S0129053395000142

Ajay K. Gupta, Hong Wang

引用次数: 0

Load Balancing: a Programmer's Approach or the Impact of Task-Length Parameters on the Load Balancing Performance of Parallel Programs 负载平衡:程序员的方法或任务长度参数对并行程序负载平衡性能的影响

Int. J. High Speed Comput. Pub Date : 1995-06-01 DOI: 10.1142/S0129053395000178

Y. Ben-Asher, A. Schuster, J. F. Sibeyn

引用次数: 3

Extensions to Cycle Shrinking 循环收缩的扩展

Int. J. High Speed Comput. Pub Date : 1995-06-01 DOI: 10.1142/S0129053395000154

A. Sethi, S. Biswas, A. Sanyal

引用次数: 2

Task Distribution on a Butterfly Multiprocessor 蝴蝶多处理器上的任务分配

Int. J. High Speed Comput. Pub Date : 1995-03-01 DOI: 10.1142/S0129053395000026

I. Gottlieb, A. Herold

引用次数: 0

Linear Algebra calculations on a Virtual Shared Memory Computer 虚拟共享内存计算机上的线性代数计算

Int. J. High Speed Comput. Pub Date : 1995-03-01 DOI: 10.1142/S0129053395000038

P. Amestoy, I. Duff, M. Daydé, Pierre Morère

{"title":"Linear Algebra calculations on a Virtual Shared Memory Computer","authors":"P. Amestoy, I. Duff, M. Daydé, Pierre Morère","doi":"10.1142/S0129053395000038","DOIUrl":"https://doi.org/10.1142/S0129053395000038","url":null,"abstract":"We evaluate the impact of the memory hierarchy of virtual shared memory computers on the design of algorithms for linear algebra. On classical shared memory multiprocessor computers, block algorithms are used for efficiency. We study here the potential and the limitations of such approaches on globally addressable distributed memory computers. The BBN TC2000 belongs to this class of computers and will be used to illustrate our discussion. We describe the implementation of Level 3 BLAS and examine the performance of some of the LAPACK routines. The impact of the number of processors with respect to the choice of the variants of classical matrix factorizations (for example, KJI, JKI, JIK for the LU factorization) is discussed. We also study the factorization of sparse matrices based on a multifrontal approach. The ideas introduced for the parallelization of full linear algebra codes are applied to the sparse case. We discuss and illustrate the limitations of this approach in sparse multifrontal factorization. We show that the speed-ups obtained on the BBN TC2000 for the class of methods presented here are comparable to those obtained on more classical shared memory computers, such as the Alliant FX/80, the CRAY-2 and the IBM 3090/VF.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127738381","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}

引用次数: 15

Restriction-Free Adaptive Wormhole Routing in Multicomputer Networks 多计算机网络中的无限制自适应虫洞路由

Int. J. High Speed Comput. Pub Date : 1995-03-01 DOI: 10.1142/S0129053395000063

Jai-Hoon Chung, H. Yoon, S. Maeng

引用次数: 0

An Efficient Parallel Algorithm for Matrix-Vector Multiplication 矩阵-向量乘法的一种高效并行算法

Int. J. High Speed Comput. Pub Date : 1995-03-01 DOI: 10.1142/S0129053395000051

B. Hendrickson, R. Leland, S. Plimpton

引用次数: 75

Parallel and Pipelined Parallel Consecutive Sums on a Hypercube with Application to Ray Casting 超立方体上的并行和管道并行连续和及其在光线投射中的应用

Int. J. High Speed Comput. Pub Date : 1995-03-01 DOI: 10.1142/S0129053395000099

Jianjian Song, R. Shu

引用次数: 0

A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints 优先约束下异构处理器任务调度的禁忌搜索方法

Int. J. High Speed Comput. Pub Date : 1995-03-01 DOI: 10.1142/S012905339500004X

S. Porto, C. Ribeiro

{"title":"A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints","authors":"S. Porto, C. Ribeiro","doi":"10.1142/S012905339500004X","DOIUrl":"https://doi.org/10.1142/S012905339500004X","url":null,"abstract":"Parallel programs may be represented as a set of interrelated sequential tasks. When multiprocessors are used to execute such programs, the parallel portion of the application can be speeded up by an appropriate allocation of processors to the tasks of the application. Given a parallel application defined by a task precedence graph, the goal of task scheduling (or processor assignment) is thus the minimization of the makespan of the application. In a heterogeneous multiprocessor system, task scheduling consists of determining which tasks will be assigned to each processor, as well as the execution order of the tasks assigned to each processor. In this work, we apply the tabu search metaheuristic to the solution of the task scheduling problem on a heterogeneous multiprocessor environment under precedence constraints. The topology of the Mean Value Analysis solution package for product form queueing networks is used as the framework for performance evaluation. We show that tabu search obtains much better results, i.e., shorter completion times, improving from 20 to 30% the makespan obtained by the most appropriate algorithm previously published in the literature.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124732395","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}

引用次数: 111

Implementing Linda Tuplespace on a Distributed System 在分布式系统上实现Linda元空间

Int. J. High Speed Comput. Pub Date : 1995-03-01 DOI: 10.1142/S0129053395000087

M. Feng, Yaoqing Gao, C. Yuen

引用次数: 8