Concurr. Pract. Exp.最新文献_第3页

Heterogeneous parallel computing using Java and WMPI 基于Java和WMPI的异构并行计算

Concurr. Pract. Exp. Pub Date : 2000-09-01 DOI: 10.1002/1096-9128(200009)12:11%3C1077::AID-CPE521%3E3.0.CO;2-%23

L. Silva, Paulo Martins, J. G. Silva

引用次数: 3

MPJ: MPI-like message passing for Java MPJ:用于Java的类似mpi的消息传递

Concurr. Pract. Exp. Pub Date : 2000-09-01 DOI: 10.1002/1096-9128(200009)12:11%3C1019::AID-CPE518%3E3.0.CO;2-G

Bryan Carpenter, V. Getov, Glenn Judd, A. Skjellum, Geoffrey C. Fox

引用次数: 183

A survey of concurrent object-oriented languages 并发面向对象语言综述

Concurr. Pract. Exp. Pub Date : 2000-08-25 DOI: 10.1002/1096-9128(20000825)12:10%3C917::AID-CPE517%3E3.0.CO;2-F

M. Philippsen

{"title":"A survey of concurrent object-oriented languages","authors":"M. Philippsen","doi":"10.1002/1096-9128(20000825)12:10%3C917::AID-CPE517%3E3.0.CO;2-F","DOIUrl":"https://doi.org/10.1002/1096-9128(20000825)12:10%3C917::AID-CPE517%3E3.0.CO;2-F","url":null,"abstract":"SUMMARY During the last decade object-oriented programming has grown from marginal influence into widespread acceptance. During the same period, progress in hardware and networking has changed the computing environment from sequential to parallel. Multi-processor workstations and clusters are now quite common. Unnumbered proposals have been made to combine both developments. Always the prime objective has been to provide the advantages of object-oriented software design at the increased power of parallel machines. However, combining both concepts has proven to be notoriously difficult. Depending on the approach, often key characteristics of either the object-oriented paradigm or key performance factors of parallelism are sacrificed, resulting in unsatisfactory languages. This survey first recapitulates well-known characteristics of both the object-oriented paradigm and parallel programming, and then marks out the design space of possible combinations by identifying various interdependencies of key concepts. The design space is then filled with data points: for 111 proposed languages we provide brief characteristics and feature tables. Feature tables, the comprehensive bibliography, and web-addresses might help in identifying open questions and preventing re-inventions. Copyright © 2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116473478","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}

引用次数: 65

Optimal striping in RAID architecture RAID架构中最优的条带化

Concurr. Pract. Exp. Pub Date : 2000-08-25 DOI: 10.1002/1096-9128(20000825)12:10%3C909::AID-CPE516%3E3.0.CO;2-D

Hai Jin, K. Hwang

引用次数: 7

Agent based scientific simulation and modeling 基于Agent的科学仿真与建模

Concurr. Pract. Exp. Pub Date : 2000-08-10 DOI: 10.1002/1096-9128(20000810)12:9%3C845::AID-CPE494%3E3.0.CO;2-J

Ladislau Bölöni, D. Marinescu, J. Rice, P. Tsompanopoulou, E. Vavalis

引用次数: 23

Shared-memory communication approaches for an MPI message-passing library 用于MPI消息传递库的共享内存通信方法

Concurr. Pract. Exp. Pub Date : 2000-08-10 DOI: 10.1002/1096-9128(20000810)12:9%3C799::AID-CPE476%3E3.0.CO;2-1

B. Protopopov, A. Skjellum

{"title":"Shared-memory communication approaches for an MPI message-passing library","authors":"B. Protopopov, A. Skjellum","doi":"10.1002/1096-9128(20000810)12:9%3C799::AID-CPE476%3E3.0.CO;2-1","DOIUrl":"https://doi.org/10.1002/1096-9128(20000810)12:9%3C799::AID-CPE476%3E3.0.CO;2-1","url":null,"abstract":"This paper discusses several approaches to designing and implementing shared-memory communication protocol modules for the message-passing interface (MPI) libraries, colloquially called ‘shared-memory devices’. The authors present a new taxonomy for classifying designs for shared-memory MPI communication devices and formulate design evaluation criteria. Using these criteria, the authors compare three existing shared-memory devices for MPICH and choose the best one. The authors also present experimental results that support their choice. The contributions of this paper are three-fold. First, the authors present the taxonomy for sharedmemory communication devices. Second, they show advantages and potential problems of the devices that belong to different classes of their taxonomy using the formulated design criteria. Third, they analyze communication performance of existing MPICH shared-memory devices, discuss optimizations of their performance, and show the performance gains that these optimizations yield. MPICH is used for comparison, since it is a widely used MPI implementation. Copyright 2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124569113","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}

引用次数: 12

Performance analysis of hybrid network multiprocessor architecture 混合网络多处理器架构的性能分析

Concurr. Pract. Exp. Pub Date : 2000-08-10 DOI: 10.1002/1096-9128(20000810)12:9%3C821::AID-CPE490%3E3.0.CO;2-8

A. Averbuch, Y. Roditty, Barack Shoham

{"title":"Performance analysis of hybrid network multiprocessor architecture","authors":"A. Averbuch, Y. Roditty, Barack Shoham","doi":"10.1002/1096-9128(20000810)12:9%3C821::AID-CPE490%3E3.0.CO;2-8","DOIUrl":"https://doi.org/10.1002/1096-9128(20000810)12:9%3C821::AID-CPE490%3E3.0.CO;2-8","url":null,"abstract":"In this paper we investigate architectures that combine message-passing and shared-memory technologies, called hereinafter hybrid architectures. We introduced hybrid architectures in which large buses of the shared-memory are split into a number of small high-performance shared-memory blocks, which are connected via message-passing architecture, such as hypercube, grid or ring. This way we avoid the possible degradation of the achieved performance due to the fact that the bus performance does not scale well when the number of processors it connects increases. We study the saturation situations of several hybrid network architectures, where adding processors does not reduce the overall execution time. We show that the use of hybrid network architectures leads to significant improvement of the systems price /performance ratio, by significantly improving the performance with almost no system cost increment. Therefore, the usage of hybrid architectures demonstrates how minimal ‘cost’ spending could significantly increase the system performance. In addition, we show that different types of applications have different best hybrid architectures. Copyright  2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122011839","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

Design of the Kan distributed object system Kan分布式对象系统的设计

Concurr. Pract. Exp. Pub Date : 2000-07-01 DOI: 10.1002/1096-9128(200007)12:8%3C755::AID-CPE508%3E3.0.CO;2-M

J. James, Ambuj K. Singh

{"title":"Design of the Kan distributed object system","authors":"J. James, Ambuj K. Singh","doi":"10.1002/1096-9128(200007)12:8%3C755::AID-CPE508%3E3.0.CO;2-M","DOIUrl":"https://doi.org/10.1002/1096-9128(200007)12:8%3C755::AID-CPE508%3E3.0.CO;2-M","url":null,"abstract":"Distributed software problems are often addressed with obj ect-oriented solutions. Objects provide the benefits of encapsulation and abstraction that have prov en useful in managing the complexity of sequential code. However, the management of distributed ob jects is typically by means of complex APIs, such as CORBA, DCOM, or Java RMI. The complexity of the A PIs is itself a hurdle to the writing of efficient, robust programs. An alternate approach is to pr ovide the programmer with a simple interface to an underlying object management layer that provides effic i nt access to objects and sufficient power for common distributed programming tasks. This paper describes the implementation of the Kan system. I t has a clear, simple object model with powerful semantics, embodying such concepts as atomic tran sactions, asynchronous method calls, and multithreading. The model primitives help the programmer a void common concurrent programming errors, allowing clean expressions of concurrent algorithms . Kan providesdistributedobjects (i.e., objects that can migrate or be replicated), rather than the remoteobjects of Java RMI. Nevertheless, Kan optimizations provide runtime object accesses that are as effici ent as or more efficient than accesses made to a similar distribution control layer over Java RMI. We des cribe the optimizations and measure their runtime impacts.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"133 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130959342","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}

引用次数: 11

A mobile agent based push methodology for global parallel computing 一种基于移动代理的全局并行计算推送方法

Concurr. Pract. Exp. Pub Date : 2000-07-01 DOI: 10.1002/1096-9128(200007)12:8%3C705::AID-CPE506%3E3.0.CO;2-X

Chengzhong Xu, B. Wims

{"title":"A mobile agent based push methodology for global parallel computing","authors":"Chengzhong Xu, B. Wims","doi":"10.1002/1096-9128(200007)12:8%3C705::AID-CPE506%3E3.0.CO;2-X","DOIUrl":"https://doi.org/10.1002/1096-9128(200007)12:8%3C705::AID-CPE506%3E3.0.CO;2-X","url":null,"abstract":"The 1990s are seeing the explosive growth of the Internet and Web-based information sharing and dissemination systems. The Internet is also showing a potential of forming of a supercomputing resource out of networked computers. Parallel computing on the Internet often works in a machine-centric “pull” execution model. That is, a coordinator machine maintains a pool of tasks and distributes the tasks to other participants on demands. This paper proposes a novel mobile agent based “push” methodology from the perspective of applications. In the method, users declare their computation-bound jobs as autonomous agents. The computational agents will roam on the Internet to find servers to run. Since the agents can be programmed to satisfy their goals, even if they move and lose contact with their creators, they can survive intermittent or unreliable network connection. During their lifetime, the agents can also move themselves autonomously from one machine to another for load balancing, enhancing data locality, and tolerating faults. We present an agent-oriented programming and resource brokerage infrastructure, TRAVELER, in support of global parallel computing. The TRAVELER provides a mechanism for clients to wrap their parallel applications as mobile agents. The agents are dispatched to a resource broker. The broker forms a parallel virtual machine atop available servers to execute the agents. TRAVELER relies on an integrated distributed shared array (DSA) runtime system to support inter-agent communication and synchronization on clusters of servers. We demonstrate the feasibility of the TRAVELER in parallel sorting and LU factorization problems.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121542870","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}

引用次数: 50

A Java/CORBA-based visual program composition environment for PSEs 基于Java/ corba的可视化程序合成环境

Concurr. Pract. Exp. Pub Date : 2000-07-01 DOI: 10.1002/1096-9128(200007)12:8%3C687::AID-CPE505%3E3.0.CO;2-P

Matthew S. Shields, O. Rana, D. Walker, Maozhen Li, D. Golby

引用次数: 15