Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000最新文献_第9页

Parallel computation for chromosome reconstruction on a cluster of workstations 基于工作站集群的染色体重构并行计算

Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.845965

S. Bhandarkar, Salem Machaka, S. Shete, J. Arnold

引用次数: 1

Effective load sharing on heterogeneous networks of workstations 异构工作站网络的有效负载共享

Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.846016

Li Xiao, Xiaodong Zhang, Yanxia Qu

{"title":"Effective load sharing on heterogeneous networks of workstations","authors":"Li Xiao, Xiaodong Zhang, Yanxia Qu","doi":"10.1109/IPDPS.2000.846016","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846016","url":null,"abstract":"We consider networks of workstations which are not only time-sharing, but also heterogeneous with a large variation in the computing power and memory capacities of different workstations. Many load sharing schemes mainly target sharing CPU resources, and have been intensively evaluated in homogeneous distributed environments. However the penalties of data accesses and movement in modern computer systems, such as page faults, have grown to the point where the overall performance of distributed systems cannot be further improved without serious considerations concerning memory resources in the design of load sharing policies. Considering both system heterogeneity and effective usage of memory resources, we design and evaluate load sharing policies in order to minimize both CPU idle times and the number of page faults in heterogeneous distributed systems. Conducting trace-driven simulations, we show that load sharing policies considering both CPU and memory resources are robust and effective in heterogeneous systems. We also show that the functionality and the nature of load sharing policies are quite independent on several memory demand distributions of workloads.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128970732","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}

引用次数: 48

Optimal on demand packet scheduling in single-hop multichannel communication systems 单跳多通道通信系统的最优按需分组调度

Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.846004

M. Bonuccelli, S. Pelagatti

引用次数: 9

Study of a multilevel approach to partitioning for parallel logic simulation 并行逻辑仿真的多级划分方法研究

Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.846071

Swaminathan Subramanian, D. Rao, P. Wilsey

引用次数: 8

Relating two-dimensional reconfigurable meshes with optically pipelined buses 将二维可重构网格与光学流水线总线相关联

Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.846060

A. Bourgeois, J. Trahan

引用次数: 17

A mechanism for speculative memory accesses following synchronizing operations 在同步操作之后进行推测性内存访问的机制

Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.845976

Takayuki Sato, K. Ohno, H. Nakashima

{"title":"A mechanism for speculative memory accesses following synchronizing operations","authors":"Takayuki Sato, K. Ohno, H. Nakashima","doi":"10.1109/IPDPS.2000.845976","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.845976","url":null,"abstract":"In order to reduce the overhead of synchronizing operations of shared memory multiprocessors, this paper proposes a mechanism, named specMEM, to execute memory accesses following a synchronizing operation speculatively before the completion of the synchronization is confirmed. A unique feature of our mechanism is that the detection of speculation failure and the restoration of computational state on the failure are implemented by a small extension of coherent cache. It is also remarkable that operations for speculation on its success and failure are performed in a constant time for each independent of the number of speculative accesses. This is realized by implementing a part of cache tag for cache line state with a simple functional memory. This paper also describes an evaluation result of specMEM applied to barrier synchronization. Performance data was obtained by simulation running benchmark programs in SPLASH-2. We found that the execution time of LU decomposition, in which the length of period between a pair of barriers significantly varies because of the fluctuation of computational load, is improved by 13%.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132251509","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

Optimal all-to-all personalized exchange in a class of optical multistage networks 一类光多级网络中最优全对全个性化交换

Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.846061

Yuanyuan Yang, Jianchao Wang

{"title":"Optimal all-to-all personalized exchange in a class of optical multistage networks","authors":"Yuanyuan Yang, Jianchao Wang","doi":"10.1109/IPDPS.2000.846061","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846061","url":null,"abstract":"All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper, we look into the issue of realizing all-to-all personalized exchange in optical multistage networks. Advances in electro-optic technologies have made optical communication a promising networking choice to meet the increasing demands for high channel bandwidth and low communication latency of high-performance computing/communication applications. Although optical multistage networks hold great promise and have demonstrated advantages over their electronic counterpart, they also hold their own challenges. Due to the unique properties of optics, crosstalk in optical switches should be avoided to make them work properly. In this paper, we will provide an optimal scheme for realizing all-to-all personalized exchange in a class of unique-path, self-routing optical multistage networks crosstalk-free. The basic idea of realizing all-to-all personalized exchange in such a multistage network is to transform it to multiple semi-permutations, each of which can be realized crosstalk-free in a single pass, and take advantage of pipelined message transmission in consecutive passes. As can be seen, the time complexity of our all-to-all personalized exchange algorithms matches the lower bound of the communication delay in this type of network.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133607314","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}

引用次数: 37

Dynamic data layouts for cache-conscious factorization of DFT 基于缓存意识的DFT分解的动态数据布局

Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.846054

Neungsoo Park, Dongsoo Kang, K. Bondalapati, V. Prasanna

引用次数: 17

A constructive solution to the juggling problem in processor array synthesis 处理器阵列综合中杂耍问题的建设性解决方法

Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.846069

A. Darte, R. Schreiber, B. R. Rau, F. Vivien

引用次数: 13

Parallel performance study of Monte Carlo photon transport code on shared-, distributed-, and distributed-shared-memory architectures 蒙特卡罗光子传输代码在共享、分布式和分布式共享内存架构上的并行性能研究

Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.845969

A. Majumdar

引用次数: 22