WILEY Journal Home Page
Papers under review through 2004
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Java for high-performance network-based computing: a survey | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 1 | ||||||||
| Date | Jan 1 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.614 | ||||||||
| Article ID | CPE614 | ||||||||
| Author Name(s) | M. Lobosco1C. Amorim2O. Loques3 | ||||||||
| Author Email(s) | lobosco@cos.ufrj.br1 amorim@cos.ufrj.br2 loques@ic.uff.br3 | ||||||||
| Affiliation(s) | COPPE, Engenharia de Sistemas, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil 1 2 Instituto de Computação, Universidade Federal Fluminense, Brazil 3 | ||||||||
| Keyword(s) | Java, parallel JVM implementation, high-performance computing, network-based computing, | ||||||||
Abstract |
|||||||||
| There has been an increasing research interest in extending the use of Java towards high-performance demanding applications such as scalable Web servers, distributed multimedia applications, and large-scale scientific applications. However, extending Java to a multicomputer environment and improving the low performance of current Java implementations pose great challenges to both the systems developer and application designer. In this survey, we describe and classify 14 relevant proposals and environments that tackle Java"s performance bottlenecks in order to make the language an effective option for high-performance network-based computing. We further survey significant performance issues while exposing the potential benefits and limitations of current solutions in such a way that a framework for future research efforts can be established. Most of the proposed solutions can be classified according to some combination of three basic parameters: the model adopted for inter-process communication, language extensions, and the implementation strategy. In addition, where appropriate to each individual proposal, we examine other relevant issues, such as interoperability, portability, and garbage collection. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | A flexible framework for consistency management | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 1 | ||||||||
| Date | Jan 1 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.615 | ||||||||
| Article ID | CPE615 | ||||||||
| Author Name(s) | S. Weber1P. A. Nixon2B. Tangney3 | ||||||||
| Author Email(s) | |||||||||
| Affiliation(s) | Distributed Systems Group, Department of Computer Science, Trinity College, Dublin 2, Ireland 1 2 3 | ||||||||
| Keyword(s) | distributed shared memory, consistency model, coherency protocol, flexibility, costumizability, | ||||||||
Abstract |
|||||||||
| Recent distributed shared memory (DSM) systems provide increasingly more support for the sharing of objects rather than portions of memory. However, like earlier DSM systems these distributed shared object systems (DSO) still force developers to use a single protocol, or a small set of given protocols, for the sharing of application objects. This limitation prevents the applications from optimizing their communication behaviour and results in unnecessary overhead. A current general trend in software systems development is towards customizable systems, for example frameworks, reflection, and aspect-oriented programming all aim to give the developer greater flexibility and control over the functionality and performance of their code. This paper describes a novel object-oriented framework that defines a DSM system in terms of a consistency model and an underlying coherency protocol. Different consistency models and coherency protocols can be used within a single application because they can be customized, by the application programmer, on a per-object basis. This allows application specific semantics to be exploited at a very fine level of granularity and with a resulting improvement in performance. The framework is implemented in JAVA and the speed-up obtained by a number of applications that use the framework is reported. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | An analysis of VI Architecture primitives in support of parallel and distributed communication | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 1 | ||||||||
| Date | Jan 1 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.616 | ||||||||
| Article ID | CPE616 | ||||||||
| Author Name(s) | Andrew Begel1Philip Buonadonna2David E. Culler3David Gay4 | ||||||||
| Author Email(s) | philipb@cs.berkeley.edu2 | ||||||||
| Affiliation(s) | University of California, Berkeley, Soda Hall, Berkeley, CA 94720-1776, U.S.A. 1 2 3 4 | ||||||||
| Keyword(s) | Active Messages, cluster-based networking, Infiniband, network abstractions, network I/O, VI Architecture, | ||||||||
Abstract |
|||||||||
| We present the results of a detailed study of the Virtual Interface (VI) paradigm as a communication foundation for a distributed computing environment. Using Active Messages and the Split-C global memory model, we analyze the inherent costs of using VI primitives to implement these high-level communication abstractions. We demonstrate a minimum mapping cost (i.e. the host processing required to map one abstraction to a lower abstraction) of 5.4 μs for both Active Messages and Split-C using four-way 550 MHz Pentium III SMPs and the Myrinet network. We break down this cost to the use of individual VI primitives in supporting flow control, buffer management and event processing and identify the completion queue as the source of the highest overhead. Bulk transfer performance plateaus at 44 Mbytes/s for both implementations are due to the addition of fragmentation requirements. Based on this analysis, we present the implications for the VI successor, Infiniband. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Parallel implementation of the fluid particle model for simulating complex fluids in the mesoscale | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 2 | ||||||||
| Date | Feb 1 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.619 | ||||||||
| Article ID | CPE619 | ||||||||
| Author Name(s) | Krzysztof Boryczko1Witold Dzwinel2David A. Yuen3 | ||||||||
| Author Email(s) | dwitek@msi.umn.edu2 | ||||||||
| Affiliation(s) | AGH Institute of Computer Science, al. Mickiewicza 30, 30-059, Kraków, Poland 1 2 Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN 55415-1227, U.S.A. 3 | ||||||||
| Keyword(s) | fluid particles, parallel algorithm, checkerboard periodic boundary conditions, phase separation, dispersion, blood flow simulation, | ||||||||
Abstract |
|||||||||
| Dissipative particle dynamics (DPD) and its generalization-the fluid particle model (FPM)-represent the ‘fluid particle’ approach for simulating fluid-like behavior in the mesoscale. Unlike particles from the molecular dynamics (MD) method, the ‘fluid particle’ can be viewed as a ‘droplet’ consisting of liquid molecules. In the FPM, ‘fluid particles’ interact by both central and non-central, short-range forces with conservative, dissipative and Brownian character. In comparison to MD, the FPM method in three dimensions requires two to three times more memory load and a three times greater communication overhead. Computational load per step per particle is comparable to MD due to the shorter interaction range allowed between ‘fluid particles’ than between MD atoms. The classical linked-cells technique and decomposing the computational box into strips allow for rapid modifications of the code and for implementing non-cubic computational boxes. We show that the efficiency of the FPM code depends strongly on the number of particles simulated, the geometry of the box and the computer architecture. We give a few examples from long FPM simulations involving up to 8 million fluid particles and 32 processors. Results from FPM simulations in three dimensions of the phase separation in binary fluid and dispersion of the colloidal slab are presented. A scaling law for symmetric quench in phase separation has been properly reconstructed. We also show that the microstructure of dispersed fluid depends strongly on the contrast between the kinematic viscosities of this fluid phase and the bulk phase. This FPM code can be applied for simulating mesoscopic flow dynamics in capillary pipes or critical flow phenomena in narrow blood vessels. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Date movement and control substrate for parallel adaptive applications | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 2 | ||||||||
| Date | Feb 1 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.617 | ||||||||
| Article ID | CPE617 | ||||||||
| Author Name(s) | Kevin Barker1Nikos Chrisochoides2Jeffrey Dobbelaere3Démian Nave4Keshav Pingali5 | ||||||||
| Author Email(s) | nikos@cs.wm.edu2 | ||||||||
| Affiliation(s) | Computer Science, College of William and Mary, Williamsburg, VA 23187, U.S.A. 1 2 3 Computer Science and Engineering, University of Notre Dame South Bend, IN 46556, U.S.A. 4Computer Science, Cornell University, Ithaca, NY 14853-3801, U.S.A. 5 | ||||||||
| Keyword(s) | message passing, runtime system, parallel adaptive applications, mesh generation, | ||||||||
Abstract |
|||||||||
| In this paper, we present the Data Movement and Control Substrate (DMCS), a library which implements low-latency one-sided communication primitives for use in parallel adaptive and irregular applications. DMCS is built on top of low-level, vendor-specific communication subsystems such as LAPI (Low-level Application Programme Interface) for IBM SP machines, as well as on widely available message-passing libraries like MPI for clusters of workstations and PCs. DMCS adds a small overhead to the communication operations provided by the lower communication system. In return, DMCS provides a flexible and easy to understand application program interface for one-sided communication operations. Furthermore, DMCS is designed so that it can be easily ported and maintained by non-experts. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | SPiDER-An advanced symbolic debugger for Fortran 90/HPF programs | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 2 | ||||||||
| Date | Feb 1 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.618 | ||||||||
| Article ID | CPE618 | ||||||||
| Author Name(s) | T. Fahringer1K. Sowa-Piekło2P. Czerwiński3P. Brezany4M. Bubak5R. Koppler6R. Wismüller7 | ||||||||
| Author Email(s) | tf@par.univie.ac.at1 | ||||||||
| Affiliation(s) | Institute for Software Science, University of Vienna, Liechtensteinstrasse 22, A-1090, Vienna, Austria 1ABB Corporate Research, ul. Starowiślna 13A, 31-038 Kraków, Poland 2 3 4 Institute of Computer Science, AGH, al. Mickiewicza 30, 30-059 Kraków, Poland 5GUP Linz, Johannes Kepler University Linz, Altenbergerstrasse 69, 4040 Linz, Austria 6Lehrstuhl für Rechnertechnik und Rechnerorganisation (LRR-TUM), Technische Universität München, D-80290 München, Germany 7 | ||||||||
| Keyword(s) | debugger, data parallel programs, message passing programs, | ||||||||
Abstract |
|||||||||
| Debuggers play an important role in developing parallel applications. They are used to control the state of many processes, to present distributed information in a concise and clear way, to observe the execution behavior, and to detect and locate programming errors. More sophisticated debugging systems also try to improve understanding of global execution behavior and intricate details of a program. In this paper we describe the design and implementation of SPiDER, which is an interactive source-level debugging system for both regular and irregular High-Performance Fortran (HPF) programs. SPiDER combines a base debugging system for message-passing programs with a high-level debugger that interfaces with an HPF compiler. SPiDER, in addition to conventional debugging functionality, allows a single process of a parallel program to be expected or the entire program to be examined from a global point of view. A sophisticated visualization system has been developed and included in SPiDER to visualize data distributions, data-to-processor mapping relationships, and array values. SPiDER enables a programmer to dynamically change data distributions as well as array values. For arrays whose distribution can change during program execution, an animated replay displays the distribution sequence together with the associated source code location. Array values can be stored at individual execution points and compared against each other to examine execution behavior (e.g. convergence behavior of a numerical algorithm). Finally, SPiDER also offers limited support to evaluate the performance of parallel programs through a graphical load diagram. SPiDER has been fully implemented and is currently being used for the development of various real-world applications. Several experiments are presented that demonstrate the usefulness of SPiDER. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Optimizing the distribution of large data sets in theory and practiceThe original version of this article was first published as ‘Rauch F, Kurmann C, Stricker TM. Optimizing the distribution of large data sets in theory and practice. Euro-Par 2000-Parallel Processing (Lecture Notes in Computer Science, vol. 1900), Bode A, Ludwig T, Karl W, Wismüller R (eds.). Springer, 2000; 1118-1131’, and is reproduced here by kind permission of the publisher. | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 3 | ||||||||
| Date | March 1 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.603 | ||||||||
| Article ID | CPE603 | ||||||||
| Author Name(s) | Felix Rauch1Christian Kurmann2Thomas M. Stricker3 | ||||||||
| Author Email(s) | rauch@inf.ethz.ch1 | ||||||||
| Affiliation(s) | Laboratory for Computer Systems, ETH - Swiss Institute of Technology, CH-8092 Zürich, Switzerland 1 2 3 | ||||||||
| Keyword(s) | software installation and maintenance, data streaming, partition management, communication modelling, multicast, input output systems, | ||||||||
Abstract |
|||||||||
| Multicasting large amounts of data efficiently to all nodes of a PC clusteris an important operation. In the form of a partition cast it can be used to replicate entire software installations by cloning. Optimizing a partition cast for a given cluster of PCs reveals some interesting architectural tradeoffs, since the fastest solution does not only depend on the network speed and topology, but remains highly sensitive to other resources like the disk speed, the memory system performance and the processing power in the participating nodes. We present an analytical model that guides an implementation towards an optimal configuration for any given PC cluster. The model is validated by measurements on our cluster using Gigabit- and Fast-Ethernet links. The resulting simple software tool, Dolly, can replicate an entire 2 GB Windows NT image onto 24 machines in less than 5 min. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Implementation and evaluation of a communication intensive application on the EARTH multithreaded systemThe original version of this article was first published as ‘Theobald KB, Kumar R, Agrawal G, Heber G, Thulasiram RK, Gao GR. Implementation and evaluation of a communication intensive application on the EARTH multithreaded system. Euro-Par 2000-Parallel Processing (Lecture Notes in Computer Science, vol. 1900), Bode A, Ludwig T, Karl W, Wismüller R (eds.). Springer, 2000; 625-637’, and is reproduced here by kind permission of the publisher. | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 3 | ||||||||
| Date | March 1 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.604 | ||||||||
| Article ID | CPE604 | ||||||||
| Author Name(s) | Kevin B. Theobald1Rishi Kumar2Gagan Agrawal3Gerd Heber4Ruppa K. Thulasiram5Guang R. Gao6 | ||||||||
| Author Email(s) | |||||||||
| Affiliation(s) | Department of Electrical and Computer Engineering, University of Delaware, Newark, DE 19716, U.S.A. 1 2 Department of Computer and Information Sciences, University of Delaware, Newark, DE 19716, U.S.A. 3Cornell Theory Center, Cornell University, Ithaca, NY 14853, U.S.A. 4 5 6 | ||||||||
| Keyword(s) | conjugate gradient, EARTH, multithreading, parallel computing, sparse matrices, | ||||||||
Abstract |
|||||||||
| This paper reports a study of sparse Matrix Vector Multiplication (MVM) on a parallel computing platform based on a fine-grained multithreaded program execution model. Such sparse MVM computations, when parallelized without performing graph partitioning, suffers a very high communication to computation ratio, and is well known to have a very limited scalability on traditional distributed-memory machines. The particular multithreaded system we use is the Efficient Architecture for Running THreads (EARTH) model, which can be implemented from off-the-shelf processors. With the Class B input sparse matrix from the NAS CG benchmark (75 000 rows), we attain an absolute speedup of 90 on 120 nodes of a distributed memory configuration. This is achieved without using inspector/executor or graph partitioning, or any communication minimization phase, which means that similar results can be expected for adaptive problems as well. High scalability is achieved because of a number of characteristics of the EARTH architecture: local synchronizations, low communication overheads, ability to overlap communication and computation, and low context-switching costs. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Parallel static and dynamic multi-constraint graph partitioningThe original version of this article was first published as ‘Schloegel K, Karypis G, Kumar V. Parallel static and dynamic multi-constraint graph partitioning. Euro-Par 2000-Parallel Processing (Lecture Notes in Computer Science, vol. 1900), Bode A, Ludwig T, Karl W, Wismüller R (eds.). Springer, 2000; 296-310’, and is reproduced here by kind permission of the publisher. | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 3 | ||||||||
| Date | March 1 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.605 | ||||||||
| Article ID | CPE605 | ||||||||
| Author Name(s) | Kirk Schloegel1George Karypis2Vipin Kumar3 | ||||||||
| Author Email(s) | kirk@cs.umn.edu1 | ||||||||
| Affiliation(s) | Army HPC Research Center, Department of Computer Science and Engineering, University of Minnesota, 4-192 EE/CS Building, 200 Union St., Minneapolis, MN 55455, U.S.A. 1 2 3 | ||||||||
| Keyword(s) | multi-constraint graph partitioning, parallel graph partitioning, multilevel graph partitioning, multi-phase scientific simulation, | ||||||||
Abstract |
|||||||||
| Sequential multi-constraint graph partitioners have been developed to address the static load balancing requirements of multi-phase simulations. These work well when (i) the graph that models the computation fits into the memory of a single processor, and (ii) the simulation does not require dynamic load balancing. The efficient execution of very large or dynamically adapting multi-phase simulations on high-performance parallel computers requires that the multi-constraint partitionings are computed in parallel. This paper presents a parallel formulation of a multi-constraint graph-partitioning algorithm, as well as a new partitioning algorithm for dynamic multi-phase simulations. We describe these algorithms and give experimental results conducted on a 128-processor Cray T3E. These results show that our parallel algorithms are able to efficiently compute partitionings of similar edge-cuts as serial multi-constraint algorithms, and can scale to very large graphs. Our dynamic multi-constraint algorithm is also able to minimize the data redistribution required to balance the load better than a naive scratch-remap approach. We have shown that both of our parallel multi-constraint graph partitioners are as scalable as the widely-used parallel graph partitioner implemented in PARMETIS. Both of our parallel multi-constraint graph partitioners are very fast, as they are able to compute three-constraint 128-way partitionings of a 7.5 million vertex graph in under 7 s on 128 processors of a Cray T3E. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Editorial | ||||||||
| Article Title | Special Issue: Euro-Par 2000 | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 3 | ||||||||
| Date | March 1 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.601 | ||||||||
| Article ID | CPE601 | ||||||||
| Author Name(s) | Roland Wismüller1 | ||||||||
| Author Email(s) | |||||||||
| Affiliation(s) | 1 | ||||||||
| Keyword(s) | |||||||||
Abstract |
|||||||||
| No abstract | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | A callgraph-based search strategy for automated performance diagnosisThe original version of this article was first published as ‘Cain HW, Miller BP, Wylie BJN. A callagraph-based search strategy for automated performance diagnosis. Euro-Par 2000-Parallel Processing (Lecture Notes in Computer Science, vol. 1900), Bode A, Ludwig T, Karl W, Wismüller R (eds.). Springer, 2000; 108-122’, and is reproduced here by kind permission of the publisher. | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 3 | ||||||||
| Date | March 1 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.602 | ||||||||
| Article ID | CPE602 | ||||||||
| Author Name(s) | Harold W. Cain1Barton P. Miller2Brian J. N. Wylie3 | ||||||||
| Author Email(s) | bart@cs.wisc.edu2 | ||||||||
| Affiliation(s) | Computer Sciences Department, University of Wisconsin, Madison, WI 53706-1685, U.S.A. 1 2 3 | ||||||||
| Keyword(s) | performance diagnosis, dynamic instrumentation, Paradyn, | ||||||||
Abstract |
|||||||||
| We introduce a new technique for automated performance diagnosis, using the program"s callgraph. We discuss our implementation of this diagnosis technique in the Paradyn Performance Consultant. Our implementation includes the new search strategy and new dynamic instrumentation to resolve pointer-based dynamic call sites at run-time. We compare the effectiveness of our new technique to the previous version of the Performance Consultant for several sequential and parallel applications. Our results show that the new search method performs its search while inserting dramatically less instrumentation into the application, resulting in reduced application perturbation and consequently a higher degree of diagnosis accuracy. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | A quality of service driven concurrency framework for object-based middleware | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 4 | ||||||||
| Date | Apr 10 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.634 | ||||||||
| Article ID | CPE634 | ||||||||
| Author Name(s) | Geoff Coulson1Oveeyen Moonian2 | ||||||||
| Author Email(s) | geoff@comp.lancs.ac.uk1 | ||||||||
| Affiliation(s) | Distributed Multimedia Research Group, Computing Department, Lancaster University, Lancaster LA1 4YR, U.K. 1 2 | ||||||||
| Keyword(s) | quality of service, concurrency framework, CPU scheduling, object-based middleware, | ||||||||
Abstract |
|||||||||
| Threads play a key role in object-based middleware platforms. Implementers of such platforms can select either kernel or user-level threads, but neither of these options are ideal. In this paper we introduce Application Scheduler Contexts (ASCs) which flexibly combine both types of thread and thereby attempt to exploit the advantages of each. Multiple ASCs can co-exist, each with their own concurrency semantics and scheduling policy. ASCs also support quality of service (QoS) configurability, and define their own QoS schema. We show how ASCs can be efficiently implemented and how they can usefully be exploited in middleware environments. We also provide a quantitative evaluation that demonstrates the feasibility of the ASC concept in performance terms. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Advanced concurrency control in Java | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 4 | ||||||||
| Date | Apr 10 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.635 | ||||||||
| Article ID | CPE635 | ||||||||
| Author Name(s) | Pascal Felber1Michael K. Reiter2 | ||||||||
| Author Email(s) | pascal@research.bell-labs.com1 | ||||||||
| Affiliation(s) | Bell Laboratories, Murray Hill, NJ 07974, U.S.A. 1Carnegie Mellon University, Pittsburgh, PA 15213, U.S.A. 2 | ||||||||
| Keyword(s) | concurrency control, isolation, transactions, Java, | ||||||||
Abstract |
|||||||||
| Developing concurrent applications is not a trivial task. As programs grow larger and become more complex, advanced concurrency control mechanisms are needed to ensure that application consistency is not compromised. Managing mutual exclusion on a per-object basis is not sufficient to guarantee isolation of sets of semantically-related actions. In this paper, we consider ‘atomic blocks’, a simple and lightweight concurrency control paradigm that enables arbitrary blocks of code to access multiple shared objects in isolation. We evaluate various strategies for implementing atomic blocks in Java, in such a way that concurrency control is transparent to the programmer, isolation is preserved, and concurrency is maximized. We discuss these concurrency control strategies and evaluate them in terms of complexity and performance. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | The Virtual Service Grid: an architecture for delivering high-end network services | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 4 | ||||||||
| Date | Apr 10 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.636 | ||||||||
| Article ID | CPE636 | ||||||||
| Author Name(s) | Jon B. Weissman1Byoung-Dai Lee2 | ||||||||
| Author Email(s) | jon@cs.umn.edu1 | ||||||||
| Affiliation(s) | Department of Computer Science and Engineering, University of Minnesota, Twin Cities, Minneapolis, MN 55455, U.S.A. 1 2 | ||||||||
| Keyword(s) | Grid computing, parallel computing, network services, resource management, | ||||||||
Abstract |
|||||||||
| This paper presents the design of a new system architecture, Virtual Service Grid (VSG), for delivering high-performance network services. The VSG is based on the concept of the virtual service which provides location, replication, and fault transparency to clients accessing remotely deployed high-end services. One of the novel features of the virtual service is the ability to self-scale in response to client demand. The VSG exploits network and service information to make adaptive dynamic replica selection, creation, and deletion decisions. We describe the VSG architecture, middleware, and replica management policies. We have deployed the VSG on a wide-area Internet testbed to evaluate its performance. The results indicate that the VSG can deliver efficient performance for a wide range of client workloads, both in terms of reduced response time and in the utilization of system resources. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Managing application complexity in the SAMRAI object-oriented frameworkThis article is a U.S. Government work and is in the public domain in the U.S.A. | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 5 | ||||||||
| Date | Apr 25 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.652 | ||||||||
| Article ID | CPE652 | ||||||||
| Author Name(s) | Richard D. Hornung1Scott R. Kohn2 | ||||||||
| Author Email(s) | hornung@llnl.gov1 | ||||||||
| Affiliation(s) | Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, U.S.A. 1 2 | ||||||||
| Keyword(s) | object-oriented programming, design patterns, adaptive mesh refinement, | ||||||||
Abstract |
|||||||||
| A major challenge facing software libraries for scientific computing is the ability to provide adequate flexibility to meet sophisticated, diverse, and evolving application requirements. Object-oriented design techniques are valuable tools for capturing characteristics of complex applications in a software architecture. In this paper, we describe certain prominent object-oriented features of the SAMRAI software library that have proven to be useful in application development. SAMRAI is used in a variety of applications and has demonstrated a substantial amount of code and design re-use in those applications. This flexibility and extensibility is illustrated with three different application codes. We emphasize two important features of our design. First, we describe the composition of complex numerical algorithms from smaller components which are usable in different applications. Second, we discuss the extension of existing framework components to satisfy new application needs. Published in 2002 by John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Editorial | ||||||||
| Article Title | Special Issue: Software architectures for scientific applications | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 5 | ||||||||
| Date | Apr 25 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.650 | ||||||||
| Article ID | CPE650 | ||||||||
| Author Name(s) | Manish Parashar1 | ||||||||
| Author Email(s) | |||||||||
| Affiliation(s) | 1 | ||||||||
| Keyword(s) | |||||||||
Abstract |
|||||||||
| No abstract | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | The CCA core specification in a distributed memory SPMD framework | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 5 | ||||||||
| Date | Apr 25 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.651 | ||||||||
| Article ID | CPE651 | ||||||||
| Author Name(s) | Benjamin A. Allan1Robert C. Armstrong2Alicia P. Wolfe3Jaideep Ray4David E. Bernholdt5James A. Kohl6 | ||||||||
| Author Email(s) | rob@ca.sandia.gov2 | ||||||||
| Affiliation(s) | Sandia National Laboratories, Livermore, CA, U.S.A. 1 2 3 4 Oak Ridge National Laboratory, Oak Ridge, TN, U.S.A. 5 6 | ||||||||
| Keyword(s) | common component architecture, high-performance computing, CCAFFEINE, peer components, SPMD, framework, | ||||||||
Abstract |
|||||||||
| We present an overview of the Common Component Architecture (CCA) core specification and CCAFFEINE, a Sandia National Laboratories framework implementation compliant with the draft specification. CCAFFEINE stands for CCA Fast Framework Example In Need of Everything; that is, CCAFFEINE is fast, lightweight, and it aims to provide every framework service by using external, portable components instead of integrating all services into a single, heavy framework core. By fast, we mean that the CCAFFEINE glue does not get between components in a way that slows down their interactions. We present the CCAFFEINE solutions to several fundamental problems in the application of component software approaches to the construction of single program multiple data (SPMD) applications. We demonstrate the integration of components from three organizations, two within Sandia and one at Oak Ridge National Laboratory. We outline some requirements for key enabling facilities needed for a successful component approach to SPMD application building. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Parallel visualization of gigabyte datasets in GeoFEM | ||||||||
| Volume ID | 14 | ||||||||
| Issue ID | 6-7 | ||||||||
| Date | May 1 2002 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.620 | ||||||||
| Article ID | CPE620 | ||||||||
| Author Name(s) | Issei Fujishiro1Li Chen2Yuriko Takeshima3Hiroko Nakamura4Yasuko Suzuki5 | ||||||||
| Author Email(s) | chen@tokyo.rist.or.jp2 | ||||||||
| Affiliation(s) | Ochanomizu University, Tokyo, Japan 1Research Organization for Information Science and Technology, Tokyo, Japan 2Tohoku University, Sendai, Japan 3 4 5 | ||||||||
| Keyword(s) | scientific visualization, parallel visualization, large-scale data visualization, volume visualization, flow visualization, polygonal simplification, feature analysis, | ||||||||
Abstract |
|||||||||
| An initial overview of parallel visualization in the GeoFEM software system is provided. Our visualization subsystem offers many kinds of parallel visualization methods for the users to visualize their huge finite-element analysis datasets for scalar, vector and/or tensor fields at a reasonable cost. A polygonal simplification scheme is developed to make the transmission and rendition of output graphic primitives more efficient. A salient feature of the subsystem lies in its capability in the automatic setting of visualization parameter values based on the analysis of scalar/flow field topology and volumetric coherence, to improve the quality of visualization results with a minimized number of batch re-executions. Representative experimental results illustrate the effectiveness of our subsystem. Copyright © 2002 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK |
| Category | Editorial |
| Article Title | Special Issue: APEC Cooperation for Earthquake Simulation |
| Volume ID | 14 |
| Issue ID |