| Publisher | John Wiley Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Autonomic oil reservoir optimization on the Grid | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 1 | ||||||||
| Date | 01 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.871 | ||||||||
| Article ID | CPE871 | ||||||||
| Author Name(s) | Manish Parashar1Vincent Matossian2Viraj Bhat3Magorzata Peszyska4Mrinal Sen5Paul Stoffa6Mary F. Wheeler7 | ||||||||
| Author Email(s) | parashar@caip.rutgers.edu1 | ||||||||
| Affiliation(s) | The Applied Software Systems Laboratory, Rutgers University, Piscataway, NJ 08855, U.S.A. 1 2 3 Department of Mathematics, Oregon State University, Corvallis, OR 97331, U.S.A. 4Institute for Geophysics, University of Texas at Austin, Austin, TX 78759, U.S.A. 5 6 Center for Subsurface Modeling, University of Texas at Austin, Austin, TX 78712, U.S.A. 7 | ||||||||
| Keyword(s) | autonomic computing, oil reservoir optimization, peer-to-peer, Grid services, | ||||||||
Abstract |
|||||||||
| The emerging Grid infrastructure and its support for seamless and secure interactions is enabling a new generation of autonomic applications where the application components, Grid services, resources, and data interact as peers to manage, adapt and optimize themselves and the overall application. In this paper we describe the design, development and operation of a prototype of such an application that uses peer-to-peer interactions between distributed services and data on the Grid to enable the autonomic optimization of an oil reservoir. Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | A role for Pareto optimality in mining performance data | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 1 | ||||||||
| Date | 01 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.877 | ||||||||
| Article ID | CPE877 | ||||||||
| Author Name(s) | Joël M. Malard1 | ||||||||
| Author Email(s) | jm.malard@pnl.gov1 | ||||||||
| Affiliation(s) | Pacific Northwest National Laboratory, Battelle Boulevard, P.O. Box 999, Richland, WA 99352, U.S.A. 1 | ||||||||
| Keyword(s) | Pareto efficiency, dendogram, multiobjective optimization, software performance, hardware events, | ||||||||
Abstract |
|||||||||
| Improvements in performance modeling and identification of computational regimes within software libraries is a critical first step in developing software libraries that are truly agile with respect to the application as well as to the hardware. It is shown here that Pareto ranking, a concept from multi-objective optimization, can be an effective tool for mining large performance datasets. The approach is illustrated using software performance data gathered using both the public domain LAPACK library and an asynchronous communication library based on IBM LAPI active message library. Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Solving the block-Toeplitz least-squares problem in parallel | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 1 | ||||||||
| Date | 01 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.883 | ||||||||
| Article ID | CPE883 | ||||||||
| Author Name(s) | P. Alonso1J. M. Badía2A. M. Vidal3 | ||||||||
| Author Email(s) | palonso@dsic.upv.es1 | ||||||||
| Affiliation(s) | Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, 46071 Valencia, Spain 1Departamento de Ingenierá y Ciencia de los Computadores, Universidad Jaume I, 12080 Castellón, Spain 2 3 | ||||||||
| Keyword(s) | least-squares problem, block-Toeplitz matrices, Toeplitz-block matrices, displacement structure, Generalized Schur Algorithm, parallel algorithms, clusters of personal computers, | ||||||||
Abstract |
|||||||||
| In this paper we present two versions of a parallel algorithm to solve the block-Toeplitz least-squares problem on distributed-memory architectures. We derive a parallel algorithm based on the seminormal equations arising from the triangular decomposition of the product TTT. Our parallel algorithm exploits the displacement structure of the Toeplitz-like matrices using the Generalized Schur Algorithm to obtain the solution in O(mn) flops instead of O(mn2) flops of the algorithms for non-structured matrices. The strong regularity of the previous product of matrices and an appropriate computation of the hyperbolic rotations improve the stability of the algorithms. We have reduced the communication cost of previous versions, and have also reduced the memory access cost by appropriately arranging the elements of the matrices. Furthermore, the second version of the algorithm has a very low spatial cost, because it does not store the triangular factor of the decomposition. The experimental results show a good scalability of the parallel algorithm on two different clusters of personal computers. Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Performance evaluation of the SX-6 vector architecture for scientific computations | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 1 | ||||||||
| Date | 01 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.884 | ||||||||
| Article ID | CPE884 | ||||||||
| Author Name(s) | Leonid Oliker1Andrew Canning2Jonathan Carter3John Shalf4David Skinner5Stéphane Ethier6Rupak Biswas7Jahed Djomehri8Rob Van der Wijngaart9 | ||||||||
| Author Email(s) | rbiswas@nas.nasa.gov7 | ||||||||
| Affiliation(s) | CRD/NERSC, Lawrence Berkeley National Laboratory, Berkeley, CA 94720, U.S.A. 1 2 3 4 5 Princeton Plasma Physics Laboratory, Princeton University, Princeton, NJ 08453, U.S.A. 6NAS Division, NASA Ames Research Center, Moffett Field, CA 94035, U.S.A. 7 8 9 | ||||||||
| Keyword(s) | microbenchmarks, NAS Parallel Benchmarks, scientific applications, vectorization, superscalar performance, | ||||||||
Abstract |
|||||||||
| The growing gap between sustained and peak performance for scientific applications is a well-known problem in high-performance computing. The recent development of parallel vector systems offers the potential to reduce this gap for many computational science codes and deliver a substantial increase in computing capabilities. This paper examines the intranode performance of the NEC SX-6 vector processor, and compares it against the cache-based IBM Power3 and Power4 superscalar architectures, across a number of key scientific computing areas. First, we present the performance of a microbenchmark suite that examines many low-level machine characteristics. Next, we study the behavior of the NAS Parallel Benchmarks. Finally, we evaluate the performance of several scientific computing codes. Overall results demonstrate that the SX-6 achieves high performance on a large fraction of our application suite and often significantly outperforms the cache-based architectures. However, certain classes of applications are not easily amenable to vectorization and would require extensive algorithm and implementation reengineering to utilize the SX-6 effectively. Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Special Issue: Grid Performance | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 2-4 | ||||||||
| Date | 01 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.922 | ||||||||
| Article ID | CPE922 | ||||||||
| Author Name(s) | John Gurd1 | ||||||||
| Author Email(s) | |||||||||
| Affiliation(s) | 1 | ||||||||
| Keyword(s) | ., | ||||||||
Abstract |
|||||||||
| . | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Performance engineering in data Grids | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 2-4 | ||||||||
| Date | 02 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.923 | ||||||||
| Article ID | CPE923 | ||||||||
| Author Name(s) | Erwin Laure1Heinz Stockinger2Kurt Stockinger3 | ||||||||
| Author Email(s) | erwin.laure@cern.ch1 | ||||||||
| Affiliation(s) | CERN, European Organization for Nuclear Research, Geneva, Switzerland 1 2 3 | ||||||||
| Keyword(s) | data Grid, performance, scheduling, replica management, | ||||||||
Abstract |
|||||||||
| The vision of Grid computing is to facilitate worldwide resource sharing among distributed collaborations. With the help of numerous national and international Grid projects, this vision is becoming reality and Grid systems are attracting an ever increasing user base. However, Grids are still quite complex software systems whose efficient use is a difficult and error-prone task. In this paper we present performance engineering techniques that aim to facilitate an efficient use of Grid systems, in particular systems that deal with the management of large-scale data sets in the tera- and petabyte range (also referred to as data Grids). These techniques are applicable at different layers of a Grid architecture and we discuss the tools required at each of these layers to implement them. Having discussed important performance engineering techniques, we investigate how major Grid projects deal with performance issues particularly related to data Grids and how they implement the techniques presented. Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Performance of a possible Grid message infrastructure | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 2-4 | ||||||||
| Date | 02 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.924 | ||||||||
| Article ID | CPE924 | ||||||||
| Author Name(s) | Shrideep Pallickara1Geoffrey Fox2Ahmet Uyar3Hongbin Liu4Xi Rao5David Walker6Beytullah Yildiz7 | ||||||||
| Author Email(s) | gcf@indiana.edu2 | ||||||||
| Affiliation(s) | Community Grid Laboratory, Indiana University, Lindley Hall 215, Bloomington, IN 47405, U.S.A. 1 2 3 4 5 Department of Computer Science, Cardiff University, U.K. 6 7 | ||||||||
| Keyword(s) | middleware, distributed messaging, P2P systems, Grid systems, audio/video conferencing, | ||||||||
Abstract |
|||||||||
| In this paper we present the results pertaining to the NaradaBrokering middleware infrastructure. NaradaBrokering is designed to run on a large network of cooperating broker nodes. NaradaBrokering capabilities include, among other things, support for a wide variety of transport protocols, Java Message Service compliance, support for routing JXTA interactions, support for audio/video conferencing applications and, finally, support for multiple constraint specification formats such as XPath, SQL and regular expression queries. This paper demonstrates the suitability of NaradaBrokering to a wide variety of applications and scenarios. Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Performance-based middleware for Grid computing | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 2-4 | ||||||||
| Date | 02 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.925 | ||||||||
| Article ID | CPE925 | ||||||||
| Author Name(s) | G. R. Nudd1S. A. Jarvis2 | ||||||||
| Author Email(s) | stephen.jarvis@warwick.ac.uk2 | ||||||||
| Affiliation(s) | High Performance Systems Group, Department of Computer Science, University of Warwick, Coventry CV4 7AL, U.K. 1 2 | ||||||||
| Keyword(s) | Grid computing, middleware, performance prediction, scheduling, quality of service, | ||||||||
Abstract |
|||||||||
| This paper describes a stateful service-oriented middleware infrastructure for the management of scientific tasks running on multi-domain heterogeneous distributed architectures. Allocating scientific workload across multiple administrative boundaries is a key issue in Grid computing and as a result a number of supporting services including match-making, scheduling and staging have been developed. Each of these services allows the scientist to utilize the available resources, although a sustainable level of service in such shared environments cannot always be guaranteed. A performance-based middleware infrastructure is described in which prediction data for each scientific task are calculated, stored and published through a Globus-based performance information service. Distributing these data allows additional performance-based middleware services to be built, two of which are described in this paper: an intra-domain predictive co-scheduler and a multi-domain workload steering system. These additional facilities significantly improve the ability of the system to meet task deadlines, as well as enhancing inter-domain load-balancing and system-wide resource utilization. Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Performance control of scientific coupled models in Grid environments | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 2-4 | ||||||||
| Date | 02 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.926 | ||||||||
| Article ID | CPE926 | ||||||||
| Author Name(s) | Christopher Armstrong1Rupert W. Ford2John R. Gurd3Mikel Luján4Kenneth R. Mayes5Graham D. Riley6 | ||||||||
| Author Email(s) | griley@cs.man.ac.uk6 | ||||||||
| Affiliation(s) | Centre for Novel Computing, University of Manchester, Oxford Road, Manchester M13 9PL, U.K. 1 2 3 4 5 6 | ||||||||
| Keyword(s) | Grid computing, performance control, component-oriented programming, coupled models, distributed computing, | ||||||||
Abstract |
|||||||||
| In recent years, there has been increasing interest in the development of computer simulations of complex biological systems, and of multi-physics and multi-scale physical phenomena. Applications have been developed that involve the coupling together of separate executable models of individual systems, where these models may have been developed in isolation. A lightweight yet general solution is required to problems of linking coupled models, and of handling the incompatibilities between interacting models that arise from their diverse origins and natures. Many such models require high-performance computers to provide acceptable execution times, and there is increasing interest in utilizing Grid technologies. However, Grid applications need the ability to cope with heterogeneous and dynamically changing execution environments, particularly where run-time changes can affect application performance. A general coupling framework (GCF) is described that allows the construction of flexible coupled models. This approach results in a component-based implementation of a coupled model application. A semi-formal presentation of GCF is given. Components under GCF are separately deployable and coupled by simple data flows, making them appropriate structures for dynamic execution platforms such as the Grid. The design and initial implementation of a performance control system (PERCO) is reviewed. PERCO acts by redeploying components, and is thus appropriate for controlling GCF coupled model applications. Redeployment decisions in PERCO require performance prediction capabilities. A proof-of-concept performance prediction algorithm is presented, based on the descriptions of GCF and PERCO. Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | The role of performance engineering techniques in the context of the Grid | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 2-4 | ||||||||
| Date | 02 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.928 | ||||||||
| Article ID | CPE928 | ||||||||
| Author Name(s) | A. J. G. Hey1J. Papay2M. Surridge3 | ||||||||
| Author Email(s) | jp@ecs.soton.ac.uk2 | ||||||||
| Affiliation(s) | EPSRC, Polaris House, North Star Avenue, Swindon SN2 1ET, U.K. 1ECS, University of Southampton, Southampton SO17 1BJ, U.K. 2IT Innovation Centre, 2 Venture Road, Chilworth Science Park, Southampton SO16 7NP, U.K. 3 | ||||||||
| Keyword(s) | performance engineering, Grid, scheduling, benchmarking, meta-applications, neuro-fuzzy models, financial transaction processing, | ||||||||
Abstract |
|||||||||
| Performance engineering can be described as a collection of techniques and methodologies whose aim is to provide reliable prediction, measurement and validation of the performance of applications on a variety of computing platforms. This paper reviews techniques for performance estimation and performance engineering developed at the University of Southampton and presents application case studies in task scheduling for engineering meta-applications, and capacity engineering for a financial transaction processing system. These show that it is important to describe performance in terms of a resource model, and that the choice of models may have to trade accuracy for utility in addressing the operational issues. We then present work from the on-going EU funded Grid project GRIA, and show how lessons learned from the earlier work have been applied to support a viable business model for Grid service delivery to a specified quality of service level. The key in this case is to accept the limitations of performance estimation methods, and design business models that take these limitations into account rather than attempting to provide hard guarantees over performance. We conclude by identifying some of the key lessons learned in the course of our work over many years and suggest possible directions for future investigations. Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | ASKALON: a tool set for cluster and Grid computing | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 2-4 | ||||||||
| Date | 02 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.929 | ||||||||
| Article ID | CPE929 | ||||||||
| Author Name(s) | Thomas Fahringer1Alexandru Jugravu2Sabri Pllana3Radu Prodan4Clovis Seragiotto5Hong-Linh Truong6 | ||||||||
| Author Email(s) | thomas.fahringer@uibk.ac.at1 | ||||||||
| Affiliation(s) | Institute for Computer Science, University of Innsbruck, Technikerstrasse 25/7, A-6020 Innsbruck, Austria 1Institute for Software Science, University of Vienna, Liechtensteinstrasse 22, A-1090 Vienna, Austria 2 3 4 5 6 | ||||||||
| Keyword(s) | cluster computing, Grid computing, parallel and distributed applications, performance prediction, measurement and analysis, bottleneck detection, experiment management, | ||||||||
Abstract |
|||||||||
| Performance engineering of parallel and distributed applications is a complex task that iterates through various phases, ranging from modeling and prediction, to performance measurement, experiment management, data collection, and bottleneck analysis. There is no evidence so far that all of these phases should/can be integrated into a single monolithic tool. Moreover, the emergence of computational Grids as a common single wide-area platform for high-performance computing raises the idea to provide tools as interacting Grid services that share resources, support interoperability among different users and tools, and, most importantly, provide omnipresent services over the Grid. We have developed the ASKALON tool set to support performance-oriented development of parallel and distributed (Grid) applications. ASKALON comprises four tools, coherently integrated into a service-oriented architecture. SCALEA is a performance instrumentation, measurement, and analysis tool of parallel and distributed applications. ZENTURIO is a general purpose experiment management tool with advanced support for multi-experiment performance analysis and parameter studies. AKSUM provides semi-automatic high-level performance bottleneck detection through a special-purpose performance property specification language. The PerformanceProphet enables the user to model and predict the performance of parallel applications at the early stages of development. In this paper we describe the overall architecture of the ASKALON tool set and outline the basic functionality of the four constituent tools. The structure of each tool is based on the composition and sharing of remote Grid services, thus enabling tool interoperability. In addition, a data repository allows the tools to share the common application performance and output data that have been derived by the individual tools. A service repository is used to store common portable Grid service implementations. A general-purpose Factory service is employed to create service instances on arbitrary remote Grid sites. Discovering and dynamically binding to existing remote services is achieved through registry services. The ASKALON visualization diagrams support both online and post-mortem visualization of performance and output data. We demonstrate the usefulness and effectiveness of ASKALON by applying the tools to real-world applications. Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Automatic performance analysis tools for the Grid | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 2-4 | ||||||||
| Date | 02 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.930 | ||||||||
| Article ID | CPE930 | ||||||||
| Author Name(s) | M. Gerndt1 | ||||||||
| Author Email(s) | m.gerndt@in.tum.de1 | ||||||||
| Affiliation(s) | Institut für Informatik X, Technische Universität München, 85748 Garching, Germany 1 | ||||||||
| Keyword(s) | performance analysis, Grid computing, parallel/distributed systems, | ||||||||
Abstract |
|||||||||
| Applications on Grids require scalable and online performance analysis tools. The execution environment of such applications includes a large number of processors. In addition, some of the resources such as the network will be shared with other applications. This requires applications to adapt dynamically to resource changes. The article presents the requirements of Grid application classes for performance analysis tools. It introduces a new analysis environment currently being developed for teraflop computers within the Peridot project at Technische Universität München. This environment applies a distributed automatic performance analysis approach. It is based on a formal specification of performance properties in the APART specification language. It uses a hierarchy of analysis agents that obtain performance data from a configurable monitoring system. This scalable design allows performance analysis for large Grid applications. Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Distributed computing in practice: the Condor experience | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 2-4 | ||||||||
| Date | 02 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.938 | ||||||||
| Article ID | CPE938 | ||||||||
| Author Name(s) | Douglas Thain1Todd Tannenbaum2Miron Livny3 | ||||||||
| Author Email(s) | thain@cs.wisc.edu1 | ||||||||
| Affiliation(s) | Computer Sciences Department, University of Wisconsin-Madison, 1210 West Dayton Street, Madison, WI 53706, U.S.A. 1 2 3 | ||||||||
| Keyword(s) | Condor, Grid, history, community, planning, scheduling, split execution, | ||||||||
Abstract |
|||||||||
| Since 1984, the Condor project has enabled ordinary users to do extraordinary computing. Today, the project continues to explore the social and technical problems of cooperative computing on scales ranging from the desktop to the world-wide computational Grid. In this paper, we provide the history and philosophy of the Condor project and describe how it has interacted with other projects and evolved along with the field of distributed computing. We outline the core components of the Condor system and describe how the technology of computing must correspond to social structures. Throughout, we reflect on the lessons of experience and chart the course travelled by research ideas as they grow into production systems. Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | The design and implementation of Grid database services in OGSA-DAI | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 2-4 | ||||||||
| Date | 02 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.939 | ||||||||
| Article ID | CPE939 | ||||||||
| Author Name(s) | Mario Antonioletti1Malcolm Atkinson2Rob Baxter3Andrew Borley4Neil P. Chue Hong5Brian Collins6Neil Hardman7Alastair C. Hume8Alan Knox9Mike Jackson10Amy Krause11Simon Laws12James Magowan13Norman W. Paton14Dave Pearson15Tom Sugden16Paul Watson17Martin Westhead18 | ||||||||
| Author Email(s) | paul.watson@newcastle.ac.uk17 | ||||||||
| Affiliation(s) | EPCC, University of Edinburgh, James Clerk Maxwell Building, Mayfield Road, Edinburgh EH9 3JZ, U.K. 1National e-Science Centre, 15 South College Street, Edinburgh EH8 9AA, U.K. 2 3 IBM United Kingdom Ltd, Hursley Park, Winchester SO21 2JN, U.K. 4 5 6 7 8 9 10 11 12 13 Department of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, U.K. 14Oracle UK Ltd, Thames Valley Park, Reading RG6 1RA, U.K. 15 16 School of Computing Science, University of Newcastle, Newcastle-upon-Tyne NE1 7RU, U.K. 17 18 | ||||||||
| Keyword(s) | Grid, databases, e-Science, Web Services, | ||||||||
Abstract |
|||||||||
| http://www.ogsadai.org.uk | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Adding tuples to Java: a study in lightweight data structures | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 5-6 | ||||||||
| Date | 04 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.835 | ||||||||
| Article ID | CPE835 | ||||||||
| Author Name(s) | C. van Reeuwijk1H. J. Sips2 | ||||||||
| Author Email(s) | c.vanreeuwijk@cs.tudelft.nl1 | ||||||||
| Affiliation(s) | Delft University of Technology, Mekelweg 4, 2628 CD Delft, The Netherlands 1 2 | ||||||||
| Keyword(s) | tuple, Java, lightweight data structures, | ||||||||
Abstract |
|||||||||
| lightweight tuples | |||||||||
| Publisher | John Wiley Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Object combining: a new aggressive optimization for object intensive programs | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 5-6 | ||||||||
| Date | 04 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.836 | ||||||||
| Article ID | CPE836 | ||||||||
| Author Name(s) | Ronald Veldema1Ceriel J. H. Jacobs2Rutger F. H. Hofman3Henri E. Bal4 | ||||||||
| Author Email(s) | veldema@cs.fau.de1 | ||||||||
| Affiliation(s) | Department of Mathematics and Computer Science, Vrije Universiteit, Amsterdam, The Netherlands 1 2 3 4 | ||||||||
| Keyword(s) | Java, garbage collection, object management, | ||||||||
Abstract |
|||||||||
| Object combining tries to put objects together that have roughly the same life times in order to reduce strain on the memory manager and to reduce the number of pointer indirections during a program's execution. Object combining works by appending the fields of one object to another, allowing allocation and freeing of multiple objects with a single heap (de)allocation. Unlike object inlining, which will only optimize objects where one has a (unique) pointer to another, our optimization also works if there is no such relation. Object inlining also directly replaces the pointer by the inlined object's fields. Object combining leaves the pointer in place to allow more combining. Elimination of the pointer accesses is implemented in a separate compiler optimization pass. Unlike previous object inlining systems, reference field overwrites are allowed and handled, resulting in much more aggressive optimization. Our object combining heuristics also allow unrelated objects to be combined, for example, those allocated inside a loop; recursive data structures (linked lists, trees) can be allocated several at a time and objects that are always used together can be combined. As Java explicitly permits code to be loaded at runtime and allows the new code to contribute to a running computation, we do not require a closed-world assumption to enable these optimizations (but it will increase performance). The main focus of object combining in this paper is on reducing object (de)allocation overhead, by reducing both garbage collection work and the number of object allocations. Reduction of memory management overhead causes execution time to be reduced by up to 35%. Indirection removal further reduces execution time by up to 6%. Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | UMM: an operational memory model specification framework with integrated model checking capability | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 5-6 | ||||||||
| Date | 04 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.837 | ||||||||
| Article ID | CPE837 | ||||||||
| Author Name(s) | Yue Yang1Ganesh Gopalakrishnan2Gary Lindstrom3 | ||||||||
| Author Email(s) | yyang@cs.utah.edu1 | ||||||||
| Affiliation(s) | School of Computing, University of Utah, Salt Lake City, UT 84112, U.S.A. 1 2 3 | ||||||||
| Keyword(s) | memory model, operational specification, Java thread, formal verification, | ||||||||
Abstract |
|||||||||
| Given the complicated nature of modern shared memory systems, it is vital to have a systematic approach to specifying and analyzing memory consistency requirements. In this paper, we present the UMM specification framework, which integrates two key features to support memory model verification: (i) it employs a simple and generic memory abstraction that can capture a large collection of memory models as guarded commands with a uniform notation, and (ii) it provides built-in model checking capability to enable formal reasoning about thread behaviors. Using this framework, memory models can be specified in a parameterized style - designers can simply redefine a few bypassing rules and visibility ordering rules to obtain an executable specification of another memory model. We formalize several classical memory models, including Sequential Consistency, Coherence, and PRAM, to illustrate the general techniques of applying this framework. We then provide an alternative specification of the Java memory model, based on a proposal from Manson and Pugh, and demonstrate how to analyze Java thread semantics using model checking. We also compare our operational specification style with axiomatic specification styles and explore a mechanism that converts a memory model definition from one style to the other.Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Ravenscar-Java: a high-integrity profile for real-time Java | ||||||||
| Volume ID | 17 | ||||||||
| Issue ID | 5-6 | ||||||||
| Date | 04 00 2005 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.843 | ||||||||
| Article ID | CPE843 | ||||||||
| Author Name(s) | Jagun Kwon1Andy Wellings2Steve King3 | ||||||||
| Author Email(s) | jagun@cs.york.ac.uk1 | ||||||||
| Affiliation(s) | Real-Time Systems Research Group, Department of Computer Science, University of York, Heslington, York YO10 5DD, U.K. 1 2 3 | ||||||||
| Keyword(s) | high-integrity systems, real-time Java, profile, | ||||||||
Abstract |
|||||||||
| For many, Java is the antithesis of a high-integrity programming language. Its combination of object-oriented programming features, its automatic garbage collection, and its poor support for real-time multi-threading are all seen as particular impediments. The Real-Time Specification for Java has introduced many new features that help in the real-time domain. However, the expressive power of these features means that very complex programming models can be created, necessitating complexity in the supporting real-time virtual machine. Consequently, Java, with the real-time extensions as they stand, seems too complex for confident use in high-integrity systems. This paper presents a Java profile for the development of software-intensive high-integrity real-time systems. This restricted programming model removes language features with high overheads and complex semantics, on which it is hard to perform timing and functional analyses. The profile fits within the J2ME framework and is consistent with well-known guidelines for high-integrity software development, such as those defined by the U.S. Nuclear Regulatory Commission.Copyright © 2005 John Wiley & Sons, Ltd. | |||||||||