Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing最新文献_第2页

A deterministic model of time for distributed systems 分布式系统的确定性时间模型

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570389

J. Carroll, A. Borshchev

引用次数: 2

B/sup mad/-tree: an efficient data structure for parallel processing B/sup /-tree:用于并行处理的高效数据结构

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570359

Sajal K. Das, M. Demuynck

{"title":"B/sup mad/-tree: an efficient data structure for parallel processing","authors":"Sajal K. Das, M. Demuynck","doi":"10.1109/SPDP.1996.570359","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570359","url":null,"abstract":"B-trees are used for accessing large database files, stored in lexicographic order on the secondary storage devices. Algorithms for concurrent B-tree data structures achieve only limited speedup when implemented on a parallel computer. To improve the performance, we propose a variant of the B/sup link/-tree, called the B/sup mad/-tree, which allows insertion without node splits, with multiple access in its leaf nodes, and dilation in both the index and the leaf nodes. Parallel algorithms for search, insert and restructuring are designed for partitioned, locked and distributed models. Only part of an insertion node is locked during the insert, and simultaneous insertions by multiple processors in the same node are allowed. A restructuring algorithm runs periodically in the background and requires at most one wait by any search or update operation. Our implementations demonstrate that the B/sup mad/-tree algorithms outperform the best known B/sup link/-trees, and compare favorably with linear hashing. We achieve good speedup (e.g., 4.79 with 8 processors) for partitioned algorithms, and moderate speedup (2.49 with 8 processors) for locked algorithms, even including overhead costs. The insert times obtained for B/sup mad/-trees are 50% to 60% less than that for the B/sup link/-trees in partitioned implementations, and 70% to 80% less in locked implementations. The speedup results on the distributed memory platform (a network of workstations) were not that encouraging due to high communication costs.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130222022","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

A deterministic parallel algorithm for the homing sequence problem 寻的序列问题的确定性并行算法

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570376

B. Ravikumar

引用次数: 4

A hardware multicast routing algorithm for two-dimensional meshes 二维网格的硬件组播路由算法

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570334

P. Mohapatra, Vara Varavithya

{"title":"A hardware multicast routing algorithm for two-dimensional meshes","authors":"P. Mohapatra, Vara Varavithya","doi":"10.1109/SPDP.1996.570334","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570334","url":null,"abstract":"Multicast communication is a significant operation an multicomputer systems and can be used to support several other collective communication operations. Hardware implementation is a viable solution to develop a low latency multicast algorithm. In this paper, we present a new multicast routing algorithm for two-dimensional meshes. The algorithm uses wormhole routing mechanism and can send messages to any number of destinations within two start-up communication phases; hence the name, two-phase multicast (TPM) algorithm. The algorithm uses the base routing scheme used for unicast communication, thus minimizing the additional hardware support. The algorithm allows some intermediate nodes that are not in the destination set to perform multicast functions. This feature allows flexibility in multicast path selection and therefore improves the performance. A simulation study has been conducted to investigate the performance of the purposed TPM algorithm. The simulation results show that the proposed TPM algorithm performs significantly better for both contention-free and mixed-traffic conditions, when compared with the previously proposed multicast algorithms.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125407603","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}

引用次数: 27

A heterogeneous hierarchical solution to cost-efficient high performance computing 一种异构分层解决方案，以实现经济高效的高性能计算

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570326

Zina Ben-Miled, J. Fortes

引用次数: 15

A load balancing algorithm for bus-oriented systems 面向总线系统的负载平衡算法

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570357

B. Joshi, S. Hosseini, K. Vairavan

引用次数: 1

Virtual embeddings on regular topology networks 规则拓扑网络上的虚拟嵌入

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570384

B. Yener

引用次数: 5

A hierarchical processor scheduling policy for multiprocessor systems 多处理器系统的分层处理器调度策略

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570322

Samir Ayachi, S. Dandamudi

{"title":"A hierarchical processor scheduling policy for multiprocessor systems","authors":"Samir Ayachi, S. Dandamudi","doi":"10.1109/SPDP.1996.570322","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570322","url":null,"abstract":"Processor scheduling policies can be broadly divided into space-sharing and time-sharing policies. Space-sharing policies partition system processors and each partition is allocated exclusively to a job. In time-sharing policies, processors are temporally shared by jobs (e.g., in a round robin fashion). Equipartition is a dynamic space-sharing policy that has been proposed and studied extensively. Among the time-sharing policies, job-based round robin policy (RRJob) has been shown to be a very good policy. Performance analysis of these two policies suggests that Equipartition policy performs well at low to moderate system loads and is extremely sensitive to system overheads and variance in service demand of jobs. RRJob performs better when there is a high variance in service demand and at high system loads. Furthermore, these policies have been proposed for small-scale shared-memory systems and require a central run queue and/or central scheduler. The central queue/scheduler poses serious scalability problems for large-scale multiprocessor systems. We propose a new multiprocessor scheduling policy that combines the merits of space-sharing and time-sharing policies while eliminating the contention for the central queue/scheduler. The new policy, called hierarchical scheduling policy (HSP), uses a hierarchical run queue organization to take advantage of both temporal and spatial partitioning to allocate processing power amongst jobs waiting for service. We show that the HSP policy is considerably better than the purely space-sharing and purely time-sharing policies over a wide range of system parameters.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125203952","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}

引用次数: 9

Improved algorithms and data structures for solving graph problems in external memory 改进了在外部存储器中解决图形问题的算法和数据结构

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570330

Vijay Kumar, E. Schwabe

引用次数: 141

Improving the parallelism and concurrency in decoupled architectures 改进解耦架构中的并行性和并发性

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570325

L. John, R. Radhakrishnan

引用次数: 0