发布求助
文献互助 智能选刊 最新文献

Int. J. High Speed Comput.最新文献

筛选
英文 中文
Executing Scheduled Task Graphs on Message-Passing Architectures 在消息传递体系结构上执行计划任务图
Int. J. High Speed Comput. Pub Date : 1996-09-01 DOI: 10.1142/S012905339600015X
Tao Yang, A. Gerasoulis
{"title":"Executing Scheduled Task Graphs on Message-Passing Architectures","authors":"Tao Yang, A. Gerasoulis","doi":"10.1142/S012905339600015X","DOIUrl":"https://doi.org/10.1142/S012905339600015X","url":null,"abstract":"A directed acyclic task graph (DAG) contains a set of tasks which access a set of data items and perform certain computations on those data items. The problem of DAG scheduling that optimizes the assignment of tasks onto the given processors has been studied extensively in the literature. We have developed a DAG scheduling system called PYRROS that maps the computation of task graphs onto message-passing machines [24]. In this paper we present a schedule executing model that incorporates several optimization strategies to reduce communication overhead and improve memory utilization. We study the correctness of task graph execution using this method and generalize this result to the iterative execution of a task graph and present experimental results on an nCUBE-2 parallel machine.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123800696","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}
引用次数: 0
On the Best Fit Submesh Allocation Strategy in Mesh-Connected Multicomputers 网格连接多计算机中最优子网格分配策略研究
Int. J. High Speed Comput. Pub Date : 1996-06-01 DOI: 10.1142/S0129053396000094
Geunmo Kim, H. Yoon
{"title":"On the Best Fit Submesh Allocation Strategy in Mesh-Connected Multicomputers","authors":"Geunmo Kim, H. Yoon","doi":"10.1142/S0129053396000094","DOIUrl":"https://doi.org/10.1142/S0129053396000094","url":null,"abstract":"The submesh allocation problem is to recognize and locate a free submesh that can accommodate a request for a submesh of a specified size. An efficient submesh allocation strategy is required for achieving high performance on mesh multicomputers. In this paper, we propose a new best fit submesh allocation strategy. The proposed strategy maintains and uses a free submesh list to get global information for free submeshes. For an allocation request, the strategy tries to allocate a best fit submesh which causes the least amount of potential fragmentation so as to preserve the large free submeshes to be as many as possible and to prevent processor fragmentation for later requests. For this purpose, we introduce a novel function for quantifying the degree of potential fragmentation of submeshes. The proposed strategy has the complete submesh recognition capability. Extensive simulation is carried out to compare it with the previous strategies, and experimental results indicate that it exhibits the best performance along with an about 30% average improvement over the previous best strategy.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"19 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120982330","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}
引用次数: 0
A Parallel Implementation of a Generalized Lanczos Procedure for Structural Dynamic Analysis 结构动力分析中广义Lanczos程序的并行实现
Int. J. High Speed Comput. Pub Date : 1996-06-01 DOI: 10.1142/S0129053396000124
D. Mackay, K. Law
{"title":"A Parallel Implementation of a Generalized Lanczos Procedure for Structural Dynamic Analysis","authors":"D. Mackay, K. Law","doi":"10.1142/S0129053396000124","DOIUrl":"https://doi.org/10.1142/S0129053396000124","url":null,"abstract":"The Lanczos method has rapidly become the preferred method of solution for the generalized eigenvalue problems. The recent emergence of parallel computers has aroused much interest in the practical implementation of the Lanczos algorithm on these high performance computers. This paper describes an implementation of a generalized Lanczos algorithm on a distributed memory parallel computer, with specific application to structural dynamic analysis. One major cost in the parallel implementation of the generalized Lanczos procedure is the factorization of the (shifted) stiffness matrix and the forward and backward solution of triangular systems. In this paper, we review a parallel sparse matrix factorization scheme and propose a strategy for inverting the principal block submatrix factors to facilitate the forward and backward solution of triangular systems on distributed memory parallel computers. We also discuss the different strategies in the implementation of mass-matrix-vector multiplication and how they are used in the implementation of the Lanczos procedure. The Lanczos procedure implemented includes partial and external selective reorthogonalizations. Spectral shifts are introduced when memory space is not sufficient for storing the Lanczos vectors. The tradeoffs between spectral shifts and Lanc-zos iterations are discussed. Numerical results on Intel’s parallel computers, the iPSC/860 hypercube and the Paragon machines will be presented to illustrate the effectiveness and scalability of the parallel generalized Lanczos procedure.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124056013","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}
引用次数: 7
Vectorizing Multistep Methods for Nonlinear Volterra integro-Differential Equations 非线性Volterra积分-微分方程的多步矢量化方法
Int. J. High Speed Comput. Pub Date : 1996-06-01 DOI: 10.1142/S0129053396000100
R. E. Shaw
{"title":"Vectorizing Multistep Methods for Nonlinear Volterra integro-Differential Equations","authors":"R. E. Shaw","doi":"10.1142/S0129053396000100","DOIUrl":"https://doi.org/10.1142/S0129053396000100","url":null,"abstract":"Many direct methods of solution are available for solving nonlinear Volterra integral and integro-differential equations. All of these methods are inherently serial and therefore have not received much attention for use on a vector or parallel computer. It is possible, however, to make modest gains in speedup by employing some novel approaches to existing methods. These modifications are discussed and numerical examples illustrate the results.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128214431","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}
引用次数: 4
Implementation of a Linear Quadtree Coding Scheme on the Parallel Virtual Machine 并行虚拟机上线性四叉树编码方案的实现
Int. J. High Speed Comput. Pub Date : 1996-03-01 DOI: 10.1142/S0129053396000069
S. Shyu, H. K. Chang, K. Chou
{"title":"Implementation of a Linear Quadtree Coding Scheme on the Parallel Virtual Machine","authors":"S. Shyu, H. K. Chang, K. Chou","doi":"10.1142/S0129053396000069","DOIUrl":"https://doi.org/10.1142/S0129053396000069","url":null,"abstract":"The linear quadtree is a useful data structure for representing an image for the sake of the storage saving and further image manipulations. In this paper we propose a linear quadtree coding scheme and implement this algorithm on the parallel virtual machine (PVM). Our goal is to demonstrate the applicability of using the PVM in combining the computing power of computers in a network to solve this kind of image processing problems. The processors in the PVM are organized as a master-slave paradigm and various numbers of processors are applied for different PVM’s to compare their performances. Experimental results show that the speedup of solving this image encoding problem in parallel is quite satisfactory. With such a PVM environment which is easily accessible in the public domain, high performance computing is truly possible without additional hardware cost.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"371 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126965402","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}
引用次数: 1
Precedence-Constrained Task Allocation in Distributed Computing Systems 分布式计算系统中的优先级约束任务分配
Int. J. High Speed Comput. Pub Date : 1996-03-01 DOI: 10.1142/S0129053396000045
D. P. Vidyarthi, A. Tripathi
{"title":"Precedence-Constrained Task Allocation in Distributed Computing Systems","authors":"D. P. Vidyarthi, A. Tripathi","doi":"10.1142/S0129053396000045","DOIUrl":"https://doi.org/10.1142/S0129053396000045","url":null,"abstract":"A distributed computing system (DCS) provides a platform for concurrent execution of tasks consisting of various modules. The problem of task allocation becomes quite difficult to solve when the precedence constraint is considered along with other constraints such as memory, network topology, etc. Various solutions have been proposed, considering one or the other constraint, in the literature. The present work discusses a comprehensive task allocation policy that can promise to provide an optimal solution to the problem. An algorithm, considering the precedence relation among the modules of a task, is proposed for allocation. The algorithm is used to show the allocation for some interconnection topologies and task graphs.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124296239","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}
引用次数: 13
Optimization of Reciprocals and Square Roots on the i860 Microprocessor i860微处理器上往复和平方根的优化
Int. J. High Speed Comput. Pub Date : 1996-03-01 DOI: 10.1142/S0129053396000057
R. Sinclair
{"title":"Optimization of Reciprocals and Square Roots on the i860 Microprocessor","authors":"R. Sinclair","doi":"10.1142/S0129053396000057","DOIUrl":"https://doi.org/10.1142/S0129053396000057","url":null,"abstract":"Reciprocal and reciprocal square root operations are partially supported by the i860 floating point unit, whereas square roots are not. We point out the reasons for this, and its consequences for the optimization of code involving many reciprocal square roots, such as many-body simulations involving Coulomb-like potentials. We conclude that code which can be optimized to explicitly combine reciprocals and square roots in the form of reciprocal square roots can attain significantly higher performance, and that assembly language coding of such operations can make the greatest use of the hardware by calculating only to the accuracy required, which may be less than single precision.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"470 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124432731","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}
引用次数: 1
Design and Implementation of a Fortran Assistant Tool for Vector Compilers 矢量编译器Fortran辅助工具的设计与实现
Int. J. High Speed Comput. Pub Date : 1996-03-01 DOI: 10.1142/S0129053396000033
Chih-Yung Chang, Jiann-Yuan Tzeng, J. Sheu
{"title":"Design and Implementation of a Fortran Assistant Tool for Vector Compilers","authors":"Chih-Yung Chang, Jiann-Yuan Tzeng, J. Sheu","doi":"10.1142/S0129053396000033","DOIUrl":"https://doi.org/10.1142/S0129053396000033","url":null,"abstract":"In this paper, we present the design and implementation of a source-to-source High Performance Fortran assistant Tool (HPFT) in DEC 3000 workstations. For a given sequential program written in Fortran 77, the HPFT generates a vectorized, reuse-exploited and/or parallelized version for vector computers. Several new compilation schemes in vectorization, reuse exploitation and multithreading are designed in the HPFT. A performance evaluator is developed for measuring the system performance. The user interface is also designed for the programmer to capture the information related to the compilation and execution of the program. Experimental results based on the Convex C3840 vector computer show that the developed HPFT enhances the system performance and usually reduces the program execution time.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132847768","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}
引用次数: 0
The Complex Dynamics of a Simple Stock Market Model 一个简单股票市场模型的复杂动态
Int. J. High Speed Comput. Pub Date : 1996-03-01 DOI: 10.1142/S0129053396000082
Moshe Levy, N. Persky, S. Solomon
{"title":"The Complex Dynamics of a Simple Stock Market Model","authors":"Moshe Levy, N. Persky, S. Solomon","doi":"10.1142/S0129053396000082","DOIUrl":"https://doi.org/10.1142/S0129053396000082","url":null,"abstract":"We formulate a microscopic model of the stock market and study the resulting macroscopic phenomena via simulation. In a market of homogeneous investors periodic booms and crashes in stock price are obtained, When there are two types of investors in the market, differing only in their memory spans, we observe sharp irregular transitions between eras where one population dominates the market and eras where the other population dominates. When the number of investor subgroups is three the market undergoes a dramatic qualitative change — it becomes complex. We show that complexity is an intrinsic property of the stock market. This suggests an alternative to the widely accepted but empirically questionable random walk hypothesis.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115436712","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}
引用次数: 30
Hierarchical Decomposition: a Parallel Implementation of the Barnes-Hut Tree Algorithm 层次分解:Barnes-Hut树算法的并行实现
Int. J. High Speed Comput. Pub Date : 1996-03-01 DOI: 10.1142/S0129053396000021
G. Bhanot, J. Janak, R. Walkup, V. Sonnad
{"title":"Hierarchical Decomposition: a Parallel Implementation of the Barnes-Hut Tree Algorithm","authors":"G. Bhanot, J. Janak, R. Walkup, V. Sonnad","doi":"10.1142/S0129053396000021","DOIUrl":"https://doi.org/10.1142/S0129053396000021","url":null,"abstract":"Given the coordinates of N points in D dimensions, the Barnes-Hut tree algorithm produces an ordered list so that successive pairs in the sequence are nearest neighbors, sets of four form a cluster, sets of eight form a bigger cluster, and so on. We describe a parallel implementation of this algorithm on the IBM SP2 using Fortran 77 and MPI message-passing calls, and study its performance.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121333773","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信