Editor's Homepage for Concurrency and Computation:Practice and Experience
Current Full Papers To Review
- C467: VGDS: A Distributed Data Structure Framework for Scientific
Computation Full
Paper
- C468: cJVM: A Cluster JVM Architecture for Single System
Image Full Paper
- C474: Parallel solution of rotating flows in cavities
Full Paper
- C475: Analysis and Measurement of the Effect of Kernel Locks in
SMP Systems Full
Paper
- C476: Effective Multicast Programming in Large Scale Distributed
Systems:The DACE Approach
- Abstract:Many distributed applications have a strong requirement for
efficient dissemination of large amounts of information to widely spread
consumers in large networks.These include applications in e-commerce and
telecommunication.Publish/subscribe is considered one of the most important
interaction styles to model communication at large scale.Producers publish
information for a topic and consumers subscribe to the topics they wish to be
informed of.The decoupling of producers and consumers in time and in space
makes the publish/subscribe paradigm very attractive for large scale
distribution,especially in environments like the Internet. This paper describes
the architecture and implementation of DACE (Distributed Asynchronous Computing
Environment),a framework for publish/subscribe communication based on an
object- oriented programming abstraction in the form of Distributed
Asynchronous Collection (DAC).DACs capture the different variations of
publish/subscribe,without blurring their respective advantages. The
architecture we present is tolerant to network partitions and crash
failures.The underlying model is based on the notion of Topic Membership:a weak
membership for the parties involved in a topic.We present how Topic Membership
enables the realization of a robust and efficient reliable multicast for large
scale.The protocol ensures that,inside a topic,even a subscriber that is
temporarily partitioned away eventually receives a published message.
- Romain Boichat, Patrick Th. Eugster, Rachid Guerraoui, Joe Sventek
- Swiss Federal Institute of Technology, Lausanne and Agilent Laboratories
Scotland, Edinburgh
- Email:Patrick.Eugster@lsesun6.epfl.ch
- Submitted July17, 2000
- Full Paper:../C476eugster/C476paper.pdf
- C486: Parallel Versions of Stone’s Strongly Implicit (SIP)
Algorithm
- Abstract:In this paper, we describe various methods of deriving a
parallel version of Stone’s Strongly Implicit Procedure (SIP) for solving
sparse linear equations arising from finite difference approximation to partial
differential equations (PDE’s). Sequential versions of this algorithm have
been very successful in solving semi-conductor, heat conduction and flow
simulation problems and an efficient parallel version would enable much larger
simulations to be run. An initial investigation of various parallelising
strategies was undertaken using a version of High Performance Fortran (HPF) and
the best methods were reprogrammed using the MPI message passing libraries for
increased efficiency. Early attempts concentrated on developing a parallel
version of the characteristic wavefront computation pattern of the existing
sequential SIP code. However, a red-black ordering of grid points, similar to
that used in parallel versions of the Gauss-Seidel algorithm, is shown to be
far more efficient. The results of both the wavefront and red-black MPI based
algorithms are reported for various size problems and number of processors on a
sixteen node IBM SP2.
- J.S. Reeve, A.D. Scurr and J.H. Merlin
- Department of Electronics and Computer Science, University of Southampton
- Email:jsr@ecs.soton.ac.uk
- Submitted August 24, 2000
- Full Paper:../C486reeve/mpijsrpaper.pdf