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

筛选
英文 中文
Mathematic-physical engine: parallel processing for modeling and simulation of physical phenomena 数学物理引擎:用于物理现象建模和仿真的并行处理
V. Jain, A. Snider
{"title":"Mathematic-physical engine: parallel processing for modeling and simulation of physical phenomena","authors":"V. Jain, A. Snider","doi":"10.1109/ISPAN.1994.367178","DOIUrl":"https://doi.org/10.1109/ISPAN.1994.367178","url":null,"abstract":"Mathematical modeling of various physical phenomena, ranging from fluid flow to electromagnetic field dynamics, from thermal patterns inside a semiconductor wafer to thermal patterns on a geophysical scale, and from combustion inside an automotive cylinder to ion transport across a biological membrane, is a challenge for the 1990s and beyond. These processes share in common a basic underlying structure in that they are described by systems of partial differential equations. This paper proposes parallel processing concepts for the real time simulation of such physical phenomena. Specifically we present a mathematic-physical engine (MPE) to solve in real time, and to display three-dimensionally, the solution of sets of ordinary or partial differential equations. In fact, different versions of the MPE are discussed ranging from a single commercial parallel machine, to networked supercomputers, to a stacked-wafer dedicated machine to suit the needs of scientists/engineers around the world. High speed networking is proposed for remote usage of an expensive MPE facility. Such a capability can enhance the ability of scientists and engineers to accelerate basic research on the one hand, and product development on the other.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"25 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":"127812611","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
Efficient implementation techniques for vector memory systems 矢量存储系统的有效实现技术
T. Chiueh, Manish Verma, Sanjay A. Padubidri
{"title":"Efficient implementation techniques for vector memory systems","authors":"T. Chiueh, Manish Verma, Sanjay A. Padubidri","doi":"10.1109/ISPAN.1994.367139","DOIUrl":"https://doi.org/10.1109/ISPAN.1994.367139","url":null,"abstract":"Existing vector machines' memory systems use heavy interleaving and SRAM technology for faster data access. In this paper, we present an efficient vector memory architecture that adopts prime-degree memory interleaving and exploits the capabilities of new-generation DRAM chips with small SRAM cache. The major contribution of this paper is an incremental indexing scheme for prime-degree memory interleaving that takes at most two integer divisions as the initial start-up overhead for each logical vector memory access, and generates one bank/offset address pair per cycle thereafter. We have also developed a vector pre-fetching scheme that ensures that vector data elements are in the SRAM buffers before they are accessed, thus effectively masking the long delays associated with normal DRAM accesses.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"434 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":"132417045","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
An efficient algorithm for solving the token distribution problem on k-ary d-cube networks 求解k元d立方网络上令牌分发问题的一种有效算法
Claude G. Diderich, M. Gengler, S. Ubéda
{"title":"An efficient algorithm for solving the token distribution problem on k-ary d-cube networks","authors":"Claude G. Diderich, M. Gengler, S. Ubéda","doi":"10.1109/ISPAN.1994.367149","DOIUrl":"https://doi.org/10.1109/ISPAN.1994.367149","url":null,"abstract":"In parallel programs where the problem data is dynamically generated, it is very useful to be able to rely on an efficient load balancing algorithm. The token distribution problem (TDP) is a generalization of the static load balancing problem. The paper describes a novel algorithm for solving the TDP for k-ary d-cube topology networks. Compared to other algorithms, our method is more general and does not rely on every processor knowing the exact number of tokens associated to each processor. The correctness of the algorithm is proved and its complexity is informally studied.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"1 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":"129310198","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
Architectural issues in designing heterogeneous parallel systems with passive star-coupled optical interconnection 无源星耦合光互连异构并行系统设计中的体系结构问题
R. Prakash, D. Panda
{"title":"Architectural issues in designing heterogeneous parallel systems with passive star-coupled optical interconnection","authors":"R. Prakash, D. Panda","doi":"10.1109/ISPAN.1994.367142","DOIUrl":"https://doi.org/10.1109/ISPAN.1994.367142","url":null,"abstract":"This paper investigates architectural and communication issues in designing heterogeneous parallel systems. The emerging high speed passive star-coupled optical interconnection using wavelength division multiplexing is considered as the system interconnect to provide high bandwidth communication demanded by heterogeneous systems. A representative master-slave computational model together with two different task scheduling strategies are used to evaluate and determine suitable communication strategy for such systems. It is shown that a hierarchical ALOHA-based communication strategy between the master and the slaves, implemented on top of the passive star-coupled network, leads to a considerable reduction in contention and task completion time compared to the direct communication from the slaves to the master. The time division multiplexed access (TDMA) approach has performance comparable to the hierarchical strategy. Depending on the application characteristics, the number of levels in the hierarchal scheme can be chosen to provide a balance between channel contention and overall execution time. These results provide guidelines for designing scalable heterogeneous systems in near future.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"52 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":"117286833","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
Optimal total exchange in linear arrays and rings 线性阵列和环的最优总交换
V. Dimakopoulos, N. Dimopoulos
{"title":"Optimal total exchange in linear arrays and rings","authors":"V. Dimakopoulos, N. Dimopoulos","doi":"10.1109/ISPAN.1994.367190","DOIUrl":"https://doi.org/10.1109/ISPAN.1994.367190","url":null,"abstract":"In this paper we consider the problem of total exchange (or multi-scattering) in the context of linear arrays and rings. Such a communication mode occurs when each node has a distinct message to send to every other node in the network. The problem has been studied extensively, although no optimal algorithm has been proposed for the two networks of interest. We present simple algorithms for the two topologies and prove their optimality.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"32 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":"114685284","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
Strategy and simulation of adaptive RID for distributed dynamic load balancing in parallel systems 并行系统分布式动态负载均衡的自适应RID策略与仿真
Lin Chengjiang, L. Sanli
{"title":"Strategy and simulation of adaptive RID for distributed dynamic load balancing in parallel systems","authors":"Lin Chengjiang, L. Sanli","doi":"10.1109/ISPAN.1994.367173","DOIUrl":"https://doi.org/10.1109/ISPAN.1994.367173","url":null,"abstract":"Dynamic load balancing schemes are essentially significant for efficiently executing non-uniform problems in highly parallel multicomputer systems. Their objective is to minimize the total execution time of single applications. This paper proposes adaptive receiver initiated diffusion (ARID) strategy for distributed dynamic load balancing. Its principle and control protocol are described. The communication overhead and the effect on system stability and performance efficiency are analyzed. Finally simulation experiments are carried out to compare the adaptive strategy with other dynamic load balancing scheme.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"2015 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":"126000777","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
Combining message switching with circuit switching in the Interconnection Cached Multiprocessor Network 互连缓存多处理机网络中消息交换与电路交换的结合
Vipul Gupta, E. Schenfeld
{"title":"Combining message switching with circuit switching in the Interconnection Cached Multiprocessor Network","authors":"Vipul Gupta, E. Schenfeld","doi":"10.1109/ISPAN.1994.367153","DOIUrl":"https://doi.org/10.1109/ISPAN.1994.367153","url":null,"abstract":"In distributed memory parallel machines, data access times can vary greatly depending on data location. This makes locality considerations important for improving performance. Switching locality is a special kind of locality which conventional networks fail to exploit fully. It refers to the phenomenon in which each computation entity in a parallel application switches most of its communication between a small set of other entities. Furthermore, the membership of these sets changes infrequently. Switching locality arises naturally in many parallel applications. The Interconnection Cached Network (ICN) is a reconfigurable network especially well suited to exploiting this locality. For applications with sufficient switching locality, appropriate choices of topology and mapping in the ICN ensure that no communication request passes through more than two switches. Short communication paths reduce propagation delays and network congestion; resulting in better overall performance. In comparison, other networks are less effective in meeting these objectives. We corroborate our stand by simulating the operation of the ICN, a multi-stage interconnection network and a 2-D Mesh network on communication graphs derived from computations on unstructured grids and sparse matrices.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"81 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":"126826477","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
Gossiping on mesh-bus computers by packets 通过分组在网络总线计算机上闲聊
S. Fujita, M. Yamashita, T. Ae
{"title":"Gossiping on mesh-bus computers by packets","authors":"S. Fujita, M. Yamashita, T. Ae","doi":"10.1109/ISPAN.1994.367143","DOIUrl":"https://doi.org/10.1109/ISPAN.1994.367143","url":null,"abstract":"A mesh-bus computer is a parallel computer in which nodes (i.e., processors) are arranged on a two-dimensional array, and nodes on each row and nodes on each column, respectively, are connected by a shared bus. The nodes communicate with each other by exchanging packets through shared buses in CREW manner. Suppose that each node initially contains a piece of information called a token. A gossiping problem is the routing problem of exchanging tokens among all nodes in the computer, which has been studied extensively as a basic communication scheme for sharing information among nodes in a parallel computer. In this paper, we propose three gossiping algorithms for mesh-bus computers assuming that each packet can carry at most l(/spl ges/1) tokens in a step. It is shown that by selecting the fastest algorithm among them, for each l, a lower bound on the gossiping time can be attained asymptotically.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"44 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":"124814503","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
Parallel maximal cliques algorithms for interval graphs with applications 区间图的并行最大团算法及其应用
Chi-Su Wang, R. Chang
{"title":"Parallel maximal cliques algorithms for interval graphs with applications","authors":"Chi-Su Wang, R. Chang","doi":"10.1109/ISPAN.1994.367160","DOIUrl":"https://doi.org/10.1109/ISPAN.1994.367160","url":null,"abstract":"In this paper, an O(n log n) time algorithm for finding all the maximal cliques of an interval graph is proposed. This algorithm can also be implemented in parallel in O(log n) time using O(n/sup 2/) processors. The maximal cliques of an interval graph contain important structural information. Many problems on interval graphs can be solved after all the maximal cliques are known. It is shown that cut vertices, bridges, and vertex connectivities can all be determined easily after the maximal cliques are known. Finally, the all-pair shortest path problem for interval graphs is solved based on the relationship between maximal cliques. The all-pair shortest path algorithm can also be parallelized in O(log n) time using O(n/sup 2/) processors.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"28 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":"130893875","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}
引用次数: 5
Message transfer algorithms on the recursive diagonal torus 递归对角环面上的消息传输算法
Yulu Yang, H. Amano
{"title":"Message transfer algorithms on the recursive diagonal torus","authors":"Yulu Yang, H. Amano","doi":"10.1109/ISPAN.1994.367185","DOIUrl":"https://doi.org/10.1109/ISPAN.1994.367185","url":null,"abstract":"Recursive diagonal torus (RDT) is a class of interconnection network for massively parallel computers with 2/sup 16/ nodes. In this paper, message transfer algorithms on the RDT are proposed and discussed. First, a simple one-to-one message routing algorithm called the vector routing is introduced and the result of its practical extension called the floating vector routing is reported. Next, broadcasting on the RDT are shown. Finally, deadlock-free message routing algorithms which are an extension of the e-cube routing are proposed.<<ETX>>","PeriodicalId":142405,"journal":{"name":"Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)","volume":"25 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":"133080472","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}
引用次数: 16
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学术文献互助群
群 号:481959085
Book学术官方微信