The pioneering research on message passing for Java (MPJ) which started after 1995 provided a crucially important framework and programming environment for parallel and distributed computing with Java. This framework resulted in an industry standard specification and a novel MPJ-based hierarchical development methodology for a new generation of large-scale distributed systems. The invention of a novel component-based model and methodology for rapid distributed software development and execution based on the MPJ work and achievements are the core contributions presented in this paper. Based on the high-performance Java component-based model, concepts and research results, grid, cloud, and extreme-scale computing represent a fundamental shift in the delivery of information technology services that has permanently changed the computing landscape.

Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record.

Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record.

Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record.

Presents a listing of the Symposium organizing committee.

This panel consists of four well-known experts in the field, who will identify several major challenges for the global adoption of cloud computing and future directions for research and development in order to meet these challenges. At the beginning of the panel session, each of the panelists will present their position statement covering certain important aspects of this subject. Then, we should have time for discussions covering both the presented statements and new ideas in the subject area.

The cloud computing paradigm emerged shortly after the introduction of the "invisible" grid concepts but it has taken only a few years for cloud computing to gain enormous momentum within industry and academia alike. However, providing adequate security support by those complex distributed systems is of primary importance for the wide adoption of cloud computing by the end users. This paper gives an overview of the main cloud security issues and challenges. Existing and proposed solutions are also presented with particular attention to the security as a service approach. Some of the available directions for future work are also discussed.

In recent years, the software development productivity has been attracting higher attention by the professional community because of its increasing importance for the development of complex software systems and applications. At the same time, component-based technologies have emerged as a modern and promising approach with a clear potential to improve significantly the productivity of software development. However, the lack of longer-term experience and the increasing complexity of the target systems demand much more research results in the field. In particular, the search for the most appropriate component model and corresponding programming environments is of high interest and importance. The higher level of complexity involves a wider range of requirements and resources which demand dedicated support for dynamic intelligent (non-functional) properties and flexibility that could be provided in an elegant way by adopting a component-based approach.

Component-oriented software development has been attracting increasing attention for building complex distributed applications. A new infrastructure supporting this advanced concept is our prototype component framework based on the Grid component model. This paper provides an overview of the component framework and presents a case study where we utilise the component-oriented approach to develop a business process application for a biometric identification system. We then introduce the tools being developed as part of an integrated development environment to enable graphical component-based development of Grid applications. Finally, we report our initial findings and experiences of efficiently using the component framework and set of software tools.

Component-based software technologies have emerged as a modern approach to software development for distributed and grid applications. However, the lack of longer-term experience and the complexity of the target systems demand more research results in the field. This paper provides an overview of three different approaches to developing component- based grid applications. In order to re-use legacy codes, the wrapper software approach can be adopted in its two flavours - hand-written or automatically generated wrapper code. Another approach applicable to existing object-oriented software is to componentise the code by introducing appropriate modifications. The third approach is component-oriented development from scratch. We compare and contrast the three approaches and highlight their advantages and weaknesses.

Component-based development has emerged as an effective approach to building flexible systems, but there is little experience in applying this approach to grid programming. This paper presents our experience with reengineering a high performance numerical solver to become a component-based grid application. The adopted component model is an extension of the generic fractal model that specifically targets grid environments. The paper provides qualitative and quantitative evidence that componentisation has improved the modifiability and reusability of the application while not significantly affecting performance.

Researchers in the biological and health industries need powerful and stable systems for their work. These systems must be dependable, fault-tolerant, highly available and easy to use. To cope with these demands we propose the use of computational and data clusters in a fail-over configuration combined with the grid technology and job scheduling. Our infrastructure has been deployed successfully for running time-critical applications in commercial environments. We also present experimental results from this pilot implementation that demonstrate the viability of our approach.

Increased computational demands and data mining present the IT world with new challenges. Amongst others, the maturing grid technology aims to address them. To take full advantage of the grid capabilities and enhance its effectiveness in complex and dynamic computational environments, we must make service management more stable, less computationally expensive and more autonomic. In this paper, we propose a synthetic approach to deal with service management in large Unix datacentres that involves the employment of intelligent agents and ontologies. These agents can automatically detect and correct faults at run-lime and manage services.

Recently, there has been a lot of interest in using Java for parallel programming. Efforts have been hindered by lack of standard Java parallel programming APIs. To alleviate this problem, various groups started projects to develop Java message passing systems modelled on the successful Message Passing Interface (MPI). Official MPI bindings are currently defined only for C, Fortran, and C++, so early MPI-like environments for Java have been divergent. This paper relates an effort undertaken by a working group of the Java Grande Forum, seeking a consensus on an MPI-like API, to enhance the viability of parallel programming using Java. Copyright © 2000 John Wiley & Sons, Ltd.

This paper discusses an approach which aims to provide legacy message passing libraries with Java-like portability in a heterogeneous, metacomputing environment. The results of such portability permit distributed computing components to be ‘soft-loaded’ or ‘soft-installed’ in a dynamic fashion, onto cooperating resources for concurrent, synchronized parallel execution. This capability provides researchers with the ability to tap into a much larger resource pool and to utilize highly tuned codes for achievingperformance. Necessarily, the Java programming language is a significant component. The Java Native Interface (JNI) is used to wrap message passing libraries written in other languages, and the bytecode which is generated for the front-end may be analyzed in order to completely determine the needs of the code which it wraps. This characterization allows the pre-configuration of a remote environment so as to be able to support execution. The usefulness of the portability gained by our approach is illustrated through examples showing the soft-installation of a process using an MPI computational substrate and the soft-installation of a process which requires a C-based communication library based upon the efficient multi-cast communication package, CCTL. The examples show that significant gains in performance can be achieved while allowing message passing execution to still exhibit high levels of portability. Copyright © 2000 John Wiley & Sons, Ltd.

Article MPI and Java-MPI: contrasts and comparisons of low-level communication performance Share on Authors: Vladimir Getov School of Computer Science, University of Westminster, Harrow HA1 3TP, UK School of Computer Science, University of Westminster, Harrow HA1 3TP, UKView Profile , Paul Gray Dept. of Mathematics and Computer Science, Emory University, Atlanta, GA Dept. of Mathematics and Computer Science, Emory University, Atlanta, GAView Profile , Vaidy Sunderam Dept. of Mathematics and Computer Science, Emory University, Atlanta, GA Dept. of Mathematics and Computer Science, Emory University, Atlanta, GAView Profile Authors Info & Claims SC '99: Proceedings of the 1999 ACM/IEEE conference on SupercomputingJanuary 1999 Pages 21–eshttps://doi.org/10.1145/331532.331553Published:01 January 1999 14citation711DownloadsMetricsTotal Citations14Total Downloads711Last 12 Months1Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

With most of today's fast scientific software written in Fortran and C, Java has a lot of catching up to do. In this paper we discuss how new Java programs can capitalize on high-performance libraries for other languages. With the help of a tool we have automatically created Java bindings for several standard libraries: MPI, BLAS, BLACS, PBLAS and ScaLAPACK. The purpose of the additional software layer introduced by the bindings is to resolve the interface problems between different programming languages such as data type mapping, pointers, multidimensional arrays, etc. For evaluation, performance results are presented for Java versions of two benchmarks from the NPB and PARKBENCH suites on the IBM SP2 using JDK and IBM's high-performance Java compiler, and on the Fujitsu AP3000 using Toba – a Java-to-C translator. The results confirm that fast parallel computing in Java is indeed possible. © 1998 John Wiley & Sons, Ltd.

Abstract The Genesis benchmark suite has been assembled to evaluate the performance of distributed‐memory MIMD systems. The problems selected all have a scientific origin (mostly from physics or theoretical chemistry), and range from synthetic code fragments designed to measure the basic hardware properties of the computer (especially communication and synchronisation overheads), through commonly used library subroutines, to full application codes. This is the second of a series of papers on the Genesis distributed‐memory benchmarks, which were developed under the European ESPRIT research program. Results are presented for the SUPRENUM and iPSC/860 computers when running the following benchmarks: COMMS1 (communications), TRANS1 (matrix transpose), FFT1 (fast Fourier transform) and QCD2 (conjugate gradient kernel). The theoretical predictions are compared with, or fitted to, the measured results, and then used to predict (with due caution) how the performance might scale for larger problems and more processors than were actually available during the benchmarking.

Abstract This is the first of a series of papers on the Genesis distributed‐memory benchmarks, which were developed under the European ESPRIT research program. The benchmarks provide a standard reference Fortran77 uniprocessor version, a distributed memory. MIMD version, and in some cases a Fortran90 version suitable for SIMD computers. The problems selected all have a scientific origin (mostly from physics or theoretical chemistry), and range from synthetic code fragments designed to measure the basic hardware properties of the computer (especially communication and synchronisation overheads), through commonly used library subroutines, to full application codes. This first paper defines the methodology to be used to analyse the benchmark results, and gives an example of a fully analysed application benchmark from General Relativity (GR1). First, suitable absolute performance metrics are carefully defined, then the performance analysis treats the execution time and absolute performance as functions of at least two variables, namely the problem size and the number of proecssors. The theoretical predictions are compared with, or fitted to, the measured results, and then used to predict (with due caution) how the performance might scale for larger problems and more processors than were actually available during the benchmarking. Benchmark measurements are given primarily for the German SUPRENUM computer, but also for the IBM 3083J, Convex C210 and a Parsys Supernode with 32 T800‐20 transputers.