Concurrency and Computation: Practice and
Experience
Published Papers for 2006
Journal
Vision
WILEY
Journal
Home Page
Papers under review through
2006
Editorial Board
2006 Volume 18 Articles
CPE1020:ShanghaiGrid: an Information Service Grid
- Author(s):Minglu Li,Min-You Wu ,Ying Li,Jian Cao,Linpeng Huang,Qianni Deng,Xinhua Lin,Changjun Jiang,Weiqin Tong ,Yadong Gui ,Aoying Zhou ,Xinhong Wu,Shui Jiang
- Department of Computer
Science and Engineering, Shanghai Jiao Tong
University, Shanghai, People's Republic of China,Tongji University,
Shanghai, People's Republic of China,Shanghai University,
Shanghai, People's Republic of China,Shanghai Supercomputer
Center, Shanghai, People's Republic of China,Fudan University,
Shanghai, People's Republic of China,Shanghai Urban
Transportation Information Center, Shanghai,
People's Republic of China,East China Institute of
Computer Technology, Shanghai, People's
Republic of China
http://dx.doi.org/10.1002/cpe.1020
CCPE Title/Author Summary
CCPE Metadata
Abstract:The goal of the ShanghaiGrid is to
provide information services to the people. It aims to
construct a metropolitan-area information service
infrastructure and establish an open standard for widespread
upper-layer applications from both communities and the
government. The Information Service Grid Toolkit and a
typical application called the Traffic Information Grid are
discussed in detail. Copyright © 2005 John Wiley
& Sons, Ltd.
CPE904:Scheduling communication in multithreaded
programs: experimental results
- Author(s):Vernon Rego, Juan Carlos Gomez,V. S. Sunderam
- Department of Computer
Sciences, Purdue University, West Lafayette, IN
47907, U.S.A.,Department of
Mathematics and Computer Science, Emory University,
Atlanta, GA 30322, U.S.A.
http://dx.doi.org/10.1002/cpe.904
CCPE Title/Author Summary
CCPE Metadata
Abstract:When the critical path of a
communication session between end points includes the
actions of operating system kernels, there are attendant
overheads. Along with other factors, such as functionality
and flexibility, such overheads motivate and favor the
implementation of communication protocols in user space.
When implemented with threads, such protocols may hold the
key to optimal communication performance and functionality.
Based on implementations of reliable user-space protocols
supported by a threads framework, we focus on our
experiences with internal threads' scheduling
techniques and their potential impact on performance. We
present scheduling strategies that enable threads to do both
application-level and communication-related processing. With
experiments performed on a Sun SPARC-5 LAN environment, we
show how different scheduling strategies yield different
levels of application-processing efficiency, communication
latency and packet-loss. This work forms part of a larger
study on the implementation of multiple thread-based
protocols in a single address space, and the benefits of
coupling protocols with applications. Copyright ©
2005 John Wiley & Sons, Ltd.
CPE905:Performance comparison of MPI and OpenMP on shared
memory multiprocessors
- Author(s):Franck Cappello,G?raud Krawezik
- LRI, Universit? de
Paris Sud, Orsay, France,
- http://dx.doi.org/10.1002/cpe.905
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:When using a shared memory
multiprocessor, the programmer faces the issue of selecting
the portable programming model which will provide the best
performance. Even if they restricts their choice to the
standard programming environments (MPI and OpenMP), they
have to select a programming approach among MPI and the
variety of OpenMP programming styles. To help the
programmer in their decision, we compare MPI with three
OpenMP programming styles (loop level, loop level with large
parallel sections, SPMD) using a subset of the NAS benchmark
(CG, MG, FT, LU), two dataset sizes (A and B), and two
shared memory multiprocessors (IBM SP3 NightHawk II, SGI
Origin 3800). We have developed the first SPMD OpenMP
version of the NAS benchmark and gathered other OpenMP
versions from independent sources (PBN, SDSC and RWCP).
Experimental results demonstrate that OpenMP provides
competitive performance compared with MPI for a large set of
experimental conditions. Not surprisingly, the two best
OpenMP versions are those requiring the strongest
programming effort. MPI still provides the best performance
under some conditions. We present breakdowns of the
execution times and measurements of hardware performance
counters to explain the performance differences. Copyright
© 2005 John Wiley & Sons, Ltd.
CPE907:Measuring and modelling the performance of a
parallel ODMG compliant object database server
- Author(s):Norman W. Paton,G?raud Krawezik,Jim Smith,Paul Watson
- Department of Computer
Science, University of Manchester, Oxford Road,
Manchester M13 9PL, U.K.,Department of Computer
Science, University of Newcastle upon Tyne,
Newcastle upon Tyne NE1 7RU, U.K.,
- http://dx.doi.org/10.1002/cpe.907
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:Object database management systems
(ODBMSs) are now established as the database management
technology of choice for a range of challenging data
intensive applications. Furthermore, the applications
associated with object databases typically have stringent
performance requirements, and some are associated with very
large data sets. An important feature for the performance of
object databases is the speed at which relationships can be
explored. In queries, this depends on the effectiveness of
different join algorithms into which queries that follow
relationships can be compiled. This paper presents a
performance evaluation of the Polar parallel object database
system, focusing in particular on the performance of
parallel join algorithms. Polar is a parallel,
shared-nothing implementation of the Object Database
Management Group (ODMG) standard for object databases. The
paper presents an empirical evaluation of queries expressed
in the ODMG Query Language (OQL), as well as a cost model
for the parallel algebra that is used to evaluate OQL
queries. The cost model is validated against the empirical
results for a collection of queries using four different
join algorithms, one that is value based and three that are
pointer based Copyright © 2005 John Wiley &
Sons, Ltd.
CPE920:The performance of parallel matrix algorithms on a broadcast-based architecture
- Author(s):Constantine Katsinis,Diana Hecht,Ming Zhu,Harsha Narravula
- Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA 19104, U.S.A.,
- http://dx.doi.org/10.1002/cpe.920
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Due to advances in fiber-optics and very large scale integration (VLSI) technology, interconnection networks which allow multiple simultaneous broadcasts are becoming feasible. This paper summarizes one such multiprocessor architecture called the Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus). It also presents enhancements to the network interface and the cache and directory controllers which support cache block combining, capture and prefetch, and allow complete overlap of processing time with the communication time due to compulsory misses. The paper uses two fundamental matrix algorithms to characterize the impact of each enhancement on performance. Cache miss analysis and results from the execution of these programs on a SOME-Bus simulator show that block capture and prefetch combined with an effective block replacement policy succeed in significantly reducing the miss rate due to compulsory misses as the cache size increases, while a similar increase of cache size in traditional architectures leaves the miss rate due to compulsory misses unaffected. Copyright © 2005 John Wiley & Sons, Ltd.
CPE921:Dynamic load-balancing mechanism for distributed Java applications
- Author(s):Violeta Felea,Bernard Toursel
- LIFL (UMR CNRS 8022), École Polytechnique Universitaire de Lille (Polytech'Lille), 59655 Villeneuve d'Ascq, France,
- http://dx.doi.org/10.1002/cpe.921
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Program environments or operating systems generally leave the decision on the allocation of program entities to the developer, offering either placement directives, or tools available through the manipulation of a graphical interface. These approaches cannot always take into account the dynamic behavior of applications, dynamicity in the execution environment or the heterogeneity of the execution platform. Transparent deployment algorithms are necessary for automizing and optimizing application distribution. The Adaptive Distributed Applications in Java (ADAJ) project deals with placement and migration of Java objects. It automatically deploys parallel Java applications on a cluster of workstations using monitoring information about the application behavior. The transparency obtained through the integration of these tools in the middleware makes such an environment easy to use and improves efficiency. Copyright © 2005 John Wiley & Sons, Ltd.
CPE941:Learning with an active e-course in the Knowledge
Grid environment
- Author(s):Hai Zhuge ,Yanyan Li
- Hunan Knowledge Grid
Lab, Hunan University of Science and Technology, China,China Knowledge Grid
Research Group, Key Lab of Intelligent Information
Processing, Institute of Computing Technology,
Chinese Academy of Sciences, P.O. Box 2704-28,
Beijing, China
http://dx.doi.org/10.1002/cpe.941
CCPE Title/Author Summary
CCPE Metadata
Abstract:An active e-course is an open,
self-representable and self-organizable media mechanism. Its
kernel idea is to organize learning materials in a concept
space rather than in a page space. The tailored content and
flexible structure of the e-courses can be dynamically
formed to cater for different learners with different
backgrounds, capabilities and expectations, at different
times and venues. The active e-course can also assess
learners' learning performances and give appropriate
suggestions to guide them in further learning. An authoring
tool for constructing course ontology and a system prototype
have been developed to support an active e-course, enabling
a learner-centred, highly interactive and adaptive learning
approach. The results of an empirical study show that the
system can help enhance the effectiveness and efficiency of
learning. Copyright ? 2005 John Wiley & Sons, Ltd
CPE908:Issues in computational frameworks
- Author(s):Aad J. van der Steen
- High Performance Computing Group, Faculty of Physics and Astronomy, P.O. Box 80195, Utrecht, The Netherlands
http://dx.doi.org/10.1002/cpe.908
CCPE Title/Author Summary
CCPE Metadata
Abstract:
In this paper we discuss issues that are common to computational frameworks for compute-intensive modeling and either need to be resolved or require design decisions to arrive at a more uniform behavior of such frameworks. Copyright © 2005 John Wiley & Sons, Ltd.
CPE917:Integration of two ocean models within Cactus
- Author(s):Fokke Dijkstra,Aad J. van der Steen
- High Performance Computing Group, Utrecht University, P.O. Box 80.195, NL-3508 TD Utrecht, The Netherlands,
- http://dx.doi.org/10.1002/cpe.917
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
We describe our experiences with the integration of two ocean models (THCM and MOM4) within a computational framework, in this case Cactus. The use of a framework like Cactus offers many advantages to computational scientists. When integrating existing code some problems are still encountered. The main problems are structural ones caused by mismatches between data structures and parallelization models. We discuss these problems and try to offer directions for improvement of the available frameworks. Copyright © 2005 John Wiley & Sons, Ltd.
CPE932:Special Issue: Computational Frameworks (have more fun with your computational models)
- Author(s):Aad J. van der Steen
- High Performance Computing Group, Faculty of Physics and Astronomy, P.O. Box 80195, Utrecht, The Netherlands
http://dx.doi.org/10.1002/cpe.932
CCPE Title/Author Summary
CCPE Metadata
Abstract:
No abstract
CPE909:Bridging the language gap in scientific computing:
the Chasm approach
- Author(s):C. E. Rasmussen,M. J. Sottile ,S. S. Shende,A. D. Malony
- Advanced Computing
Laboratory, Los Alamos National Laboratory, Los
Alamos, NM, U.S.A.,Department of Computer
and Information Science, University of Oregon,
Eugene, OR, U.S.A.,
- http://dx.doi.org/10.1002/cpe.909
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:Chasm is a toolkit providing seamless
language interoperability between Fortran 95 and C++.
Language interoperability is important to scientific
programmers because scientific applications are
predominantly written in Fortran, while software tools are
mostly written in C++. Two design features differentiate
Chasm from other related tools. First, we avoid the
common-denominator type systems and programming models found
in most Interface Definition Language (IDL)-based
interoperability systems. Chasm uses the intermediate
representation generated by a compiler front-end for each
supported language as its source of interface information
instead of an IDL. Second, bridging code is generated for
each pairwise language binding, removing the need for a
common intermediate data representation and multiple levels
of indirection between the caller and callee. These features
make Chasm a simple system that performs well, requires
minimal user intervention and, in most instances, bridging
code generation can be performed automatically. Chasm is
also easily extensible and highly portable. Copyright ? 2005
John Wiley & Sons, Ltd.
CPE910:GCF: a general coupling framework
- Author(s):M.K. Bane,G. D. Riley ,R.W. Ford,C. W. Armstrong ,L. Freeman
- Centre for Novel
Computing, University of Manchester, Manchester M13
9PL, U.K.,
- http://dx.doi.org/10.1002/cpe.910
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:Coupled modelling is increasingly
necessary to make progress in understanding the science of
complex physical phenomena and a number of bespoke (custom)
coupled solutions to specific scientific challenges have
emerged in recent years. These coupled models generally
consist of some framework code in which individual models
are embedded. The framework code promotes the required
interoperation of the models to solve the larger problem
being addressed. Bespoke solutions limit the ability of
scientists to share models and to couple them together
flexibly to produce (efficient) implementations to address
new problems. This paper presents an approach, GCF, which
addresses several of these limitations. Individual model
sharing and flexibility in composition and deployment is
achieved by imposing some lightweight development rules for
single models and capturing information relating to the
models themselves, to their composition into coupled models
and to their deployment onto computational resources as
machine-readable metadata. These metadata can be processed
to support the generation of an implementation of the
coupled model required by the developer. For example, lean
and efficient framework code for the specific coupled model
and deployment described by the developer can be generated.
Alternatively, GCF-compliant models can be automatically
adapted for use within other, existing frameworks. This
paper presents the design and implementation of a bespoke
framework generator to achieve the former, and the
flexibility in the composition of GCF-compliant models is
demonstrated. Copyright © 2005 John Wiley &
Sons, Ltd.
CPE911:The CCA component model for high-performance scientific computing
- Author(s):Rob Armstrong,Gary Kumfert,Lois Curfman McInnes,Steven Parker,Ben Allan,Matt Sottile,Thomas Epperly,Tamara Dahlgren
- Sandia National Laboratories, Livermore, CA 94551-9915, U.S.A.,Lawrence Livermore National Laboratory, Livermore, CA 94550, U.S.A.,Argonne National Laboratory, Argonne, IL 10439, U.S.A.,University of Utah, Salt Lake City, UT 84112, U.S.A.,Los Alamos National Laboratory, Los Alamos, NM 87545, U.S.A.,
- http://dx.doi.org/10.1002/cpe.911
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
The Common Component Architecture (CCA) is a component model for high-performance computing, developed by a grass-roots effort of computational scientists. Although the CCA is usable with CORBA-like distributed-object components, its main purpose is to set forth a component model for high-performance, parallel computing. Traditional component models are not well suited for performance and massive parallelism. We outline the design pattern for the CCA component model, discuss our strategy for language interoperability, describe the development tools we provide, and walk through an illustrative example using these tools. Performance and scalability, which are distinguishing features of CCA components, affect choices throughout design and implementation. Copyright © 2005 John Wiley & Sons, Ltd.
CPE912:Coupling climate models with the Earth System Modeling Framework and the Common Component Architecture
- Author(s):S. J. Zhou
- Northrop Grumman Information Technology/TASC, 4801 Stonecroft Boulevard, Chantilly, VA 20151, U.S.A.
http://dx.doi.org/10.1002/cpe.912
CCPE Title/Author Summary
CCPE Metadata
Abstract:
Typical Earth system models involve coupled model components in high-performance computing (HPC) environments. In the last few years, several frameworks have been developed for HPC applications. Two of them are component-based frameworks: the Earth System Modeling Framework (ESMF) defining a component interface for Earth system models and the Common Component Architecture (CCA) defining a generic component model. The purpose of this work is to investigate the relationship between ESMF and CCA to deploy the best features of ESMF and CCA into a ESMF-CCA prototype and examine the prototype through a representative coupled climate model. Copyright © 2005 John Wiley & Sons, Ltd.
CPE913:MpCCI-a tool for the simulation of coupled applications
- Author(s):W. Joppich,M. Kürschner
- Fraunhofer Institute for Algorithms and Scientific Computing (SCAI), Schloss Birlinghoven, D-53754 Sankt Augustin, Germany,
- http://dx.doi.org/10.1002/cpe.913
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Many industrial and scientific applications are characterized by the interaction of different disciplines, such as fluid-structure interactions. For the individual disciplines sophisticated and validated solvers exist. This paper describes basic ideas, implementation details and application of MpCCI (mesh-based parallel code coupling interface), a tool for the coupling of different simulation codes. Copyright © 2005 John Wiley & Sons, Ltd.
CPE914:PALM: a computational framework for assembling high-performance computing applications
- Author(s):Samuel Buis,Andrea Piacentini,Damien Déclat
- CERFACS, European Centre for Research and Advanced Training in Scientific Computation, Toulouse, France,
- http://dx.doi.org/10.1002/cpe.914
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
The PALM project aims to implement a general tool allowing the easy integration of high-performance computing applications in a flexible and evolutive way. It was originally designed for oceanographic data assimilation algorithms, but its application domain extends to multiple scientific applications. In the framework of PALM, applications are split into elementary components that can exchange data. The main features of PALM are the dynamic launching of the coupled components, the full independence of the components from the application algorithm, the parallel data exchanges with redistribution and the separation of the physics from the algebraic manipulations performed by the PALM algebra toolbox. Copyright © 2005 John Wiley & Sons, Ltd.
CPE915:PRISM and ENES: a European approach to Earth
system modelling
- Author(s):Sophie Valcke,Eric Guilyardi,Claes Larsson
- CERFACS, European
Centre for Research and Advanced Training in
Scientific Computation, Toulouse, France,Centre for Global
Atmospheric Modelling, University of Reading, U.K.,The European Centre for
Medium-Range Weather Forecasts, Reading, U.K.
http://dx.doi.org/10.1002/cpe.915
CCPE Title/Author Summary
CCPE Metadata
Abstract:Europe's widely distributed
climate modelling expertise, now organized in the European
Network for Earth System Modelling (ENES), is both a
strength and a challenge. Recognizing this, the European
Union's Program for Integrated Earth System Modelling
(PRISM) infrastructure project aims at designing a flexible
and friendly user environment to assemble, run and
post-process Earth System models. PRISM was started in
December 2001 with a duration of three years. This paper
presents the major stages of PRISM, including: 1 [(1)] the
definition and promotion of scientific and technical
standards to increase component modularity; 2 [(2)] the
development of an end-to-end software environment (graphical
user interface, coupling and I/O system, diagnostics,
visualization) to launch, monitor and analyse complex Earth
system models built around state-of-art community component
models (atmosphere, ocean, atmospheric chemistry, ocean
bio-chemistry, sea-ice, land-surface); and 3 [(3)] testing
and quality standards to ensure high-performance computing
performance on a variety of platforms. PRISM is emerging as
a core strategic software infrastructure for building the
European research area in Earth system sciences. Copyright
© 2005 John Wiley & Sons, Ltd.
CPE916:A Problem Solving Environment for interactive
modelling of multiway data
- Author(s):Ivo H. M. van Stokkum,Henri E. Bal
- Faculty of Sciences,
Vrije Universiteit, De Boelelaan 1081, 1081 HV,
Amsterdam, The Netherlands,
- http://dx.doi.org/10.1002/cpe.916
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:A prototype Problem Solving Environment
(PSE) is presented for problems in interactive modelling of
multiway data. Multiway data result from measurements as a
function of two or more independent variables. The PSE
comprises a parameter estimation loop and a model adjustment
loop. The model can be specified hierarchically using
mathematically described building blocks which encapsulate
the model assumptions. A typical case study of three-way
data illustrates the need for interactive model adjustment.
Requirements for interactive problem solving are discussed.
Copyright © 2005 John Wiley & Sons, Ltd.
CPE942:Special Issue: Coordination Models and Systems
- Author(s):Sascha Ossowski,Ronaldo Menezes
- Universidad Rey Juan Carlos,Florida Institute of Technology
http://dx.doi.org/10.1002/cpe.942
CCPE Title/Author Summary
CCPE Metadata
Abstract:
No abstract
CPE943:On coordination and its significance to distributed and multi-agent systems
- Author(s):Sascha Ossowski,Ronaldo Menezes
- Department of Computer Science, Universidad Rey Juan Carlos, Calle Tulipán s/n, 28933 Móstoles (Madrid), Spain,Department of Computer Science, Florida Institute of Technology, 150 West University Boulevard, Melbourne, FL 32901, U.S.A.
http://dx.doi.org/10.1002/cpe.943
CCPE Title/Author Summary
CCPE Metadata
Abstract:
those
distribution
standard
emergent coordination
CPE944:Experiments on robustness and deception in a coalition formation model
- Author(s):M. V. Belmonte,R. Conejo,J. L. Perez-de-la-Cruz,F. Triguero
- Dpt. Lenguajes y Ciencias de la Computacion, ETSI Informatica, Universidad de Malaga, Malaga 29071, Spain,
- http://dx.doi.org/10.1002/cpe.944
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
In the last few years coalition formation algorithms have been proposed as a possible way of modeling autonomous agent cooperation in multi-agent systems. This work is based on a previously proposed coalition formation model founded on game theory for a class of task-oriented problems that guarantees an optimum task allocation and a stable profit division. In this paper we study two properties of the model that are very important for application in real-life scenarios: robustness and tolerance to an agent's misbehavior. First, we study the robustness of this model as regards the effect the agent's failure has on the resultant profits of the coalition formation. Secondly, we also study the coalition formation model in the presence of misbehaving agents. Agents have some kind of execution autonomy, and they can deceive or mislead each other when they reveal their information, if they believe this will give them more profits. Copyright © 2005 John Wiley & Sons, Ltd.
CPE945:The transparent implementation of agent communication contexts
- Author(s):Antonella Di Stefano,Giuseppe Pappalardo,Corrado Santoro,Emiliano Tramontana
- Dipartimento di Ingegneria Informatica e delle Telecomunicazioni, Università di Catania, Italy,Dipartimento di Matematica e Informatica, Università di Catania, Italy,
- http://dx.doi.org/10.1002/cpe.945
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Agent Communication Contexts (ACCs) are virtual environments where agents may live and interact. In this way, as in a human society, interactions may be subject to conventions and laws depending on the context where they occur. For this to be possible, an ACC should embed the communication laws relevant to the intended class of agent applications and enforce them, as interactions among agents take place. Although context is a communication aspect relevant for all the agents of an application, its modelling should be, in principle, an orthogonal concern with respect to the design of the activities of each agent. Consistently with this view, this work advocates the separate development of, respectively, agent behaviour, and the interaction aspects constituting the context. The latter is first abstractly specified as a set of communication laws, then automatically implemented by a tool that generates the necessary ACC management and checking code from the specification. The appropriate portions of this code should be activated whenever an interaction between agents takes place, so as to ensure that (i) the constraints specified by the laws are respected by the interaction, and (ii) the actions some of the laws require are carried out before the interaction actually occurs. Moreover, this work proposes an infrastructure whereby ACC code is triggered at runtime, whenever agents interact with each other. No source code modification or recompilation is required for this. All is seamlessly accomplished by means of computational reflection, which transparently changes the meaning of the communication primitives normally used by agent programmers. Copyright © 2005 John Wiley & Sons, Ltd.
CPE946:X-Folders: documents on the move
- Author(s):D. Rossi
- Department of Computer Science, University of Bologna, Italy
http://dx.doi.org/10.1002/cpe.946
CCPE Title/Author Summary
CCPE Metadata
Abstract:
X-Folders is a software environment for multi-party document-based processes that aims at supporting the implementation of workflows involving multiple users that interact by means of documents stored in special, reactive, folders: the X-Folders. A reaction in X-Folders is a program whose control flow depends on the status of the folder and whose actions are invocations of local services (that can be used to interact with the documents in the folders) or of services exposed by external components. The actions performed by the actors and the reactions fired by the system flow in a sequence that drives to the accomplishment of the workflow process coordinating humans and software components using documents. Copyright © 2005 John Wiley & Sons, Ltd.
CPE947:Self-maintained distributed tuples for field-based coordination in dynamic networks
- Author(s):Marco Mamei,Franco Zambonelli
- Dipartimento di Scienze e Metodi dell'Ingegneria, Università di Modena e Reggio Emilia, Viale Allegri, 13, 42100 Reggio Emilia, Italy,
- http://dx.doi.org/10.1002/cpe.947
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Field-based coordination is a promising approach to orchestrating the activities of components in a wide range of application scenarios. To implement such an approach, one can rely on distributed tuples injected into a network and then propagated to form field-like distributed data structures to be sensed by application components. Moreover, to gain the full benefits from such an approach, it is important to enable the distributed tuples to preserve their structures despite the dynamics of the network. In this paper, we show how a variety of self-maintained distributed tuples for field-based coordination can be easily programmed in the Tuples On The Air (TOTA) middleware. Several examples clarify the approach, and a case study is detailed throughout the paper to ground the discussion. Eventually, performance data are presented to verify the effectiveness of the approach. Copyright © 2005 John Wiley & Sons, Ltd.
CPE1055:Erratum
http://dx.doi.org/10.1002/cpe.1055
CCPE Title/Author Summary
CCPE Metadata
Abstract:
Concurrency Computation: Practice and Experience
17
Due to a printing error, all of the equations in the above article were printed incorrectly. The correct version of the article can be viewed online at:
http://www3.interscience.wiley.com/cgi-bin/fulltext/110546382/PDFSTART
The Publishers would like to apologise for any confusion that might have been caused by this error.
CPE919:FairThreads: mixing cooperative and preemptive threads in C
- Author(s):Frédéric Boussinot
- EMP-CMA/INRIA-MIMOSA Project, 2004 route des Lucioles-BP 93, F-06902 Sophia Antipolis, Cedex, France
http://dx.doi.org/10.1002/cpe.919
CCPE Title/Author Summary
CCPE Metadata
Abstract:
FairThreads introduces fair threads which are executed in a cooperative way when linked to a scheduler, and in a preemptive way otherwise. Constructs exist for programming the dynamic linking/unlinking of threads during execution. Users can profit from the cooperative scheduling when threads are linked. For example, data only accessed by the threads linked to the same scheduler does not need to be protected by locks. Users can also profit from the preemptive scheduling provided by the operating system (OS) when threads are unlinked, for example to deal with blocking I/Os. In the cooperative context, for the threads linked to the same scheduler, FairThreads make it possible to use broadcast events. Broadcasting is a powerful, abstract, and modular means of communication. Basically, event broadcasting is made possible by the specific way threads are scheduled by the scheduler to which they are linked (the ‘fair’ strategy). FairThreads give a way to deal with some limitations of the OS. Automata are special threads, coded as state machines, which do not need the allocation of a native thread and which have efficient execution. Automata also give a means to deal with the limited number of native threads available when large numbers of concurrent tasks are needed, for example in simulations. Copyright © 2005 John Wiley & Sons, Ltd.
CPE934:Proceedings of the IEEE/IFIP 2001 International Conference on Dependable Systems and Networks (DSN01)
- Author(s):Jiannong Cao,Alvin T. S. Chan,Stephen C. F. Chan,Nick K. C. Cheung
- Software Development and Management Laboratory, Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong,
- http://dx.doi.org/10.1002/cpe.934
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
The monitor concept provides a structured and flexible high-level programming construct to control concurrent accesses to shared resources. It has been widely used in a concurrent programming environment for implicitly ensuring mutual exclusion and explicitly achieving process synchronization. This paper proposes an extension to the monitor construct for detecting runtime errors in monitor operations. Monitors are studied and classified according to their functional characteristics. A taxonomy of concurrency control faults over a monitor is then defined. The concepts of a monitor event sequence and a monitor state sequence provide a uniform approach to history information recording and fault detection. Rules for detecting various types of faults are defined. Based on these rules, fault-detection algorithms are developed. A prototypical implementation of the proposed monitor construct with runtime fault detection mechanisms has been developed in Java. We shall briefly report our experience with and the evaluation of the robust monitor prototype. Copyright © 2005 John Wiley & Sons, Ltd.
CPE940:Parallel iterative multilevel solution of mixed finite element systems for scalar equations
- Author(s):V. Chugunov,D. Svyatski,E. Tyrtyshnikov,Yu. Vassilevski
- Institute of Numerical Mathematics, Russian Academy of Sciences, 8 Gubkina Street, 119991, GSP-1, Moscow, Russia,
- http://dx.doi.org/10.1002/cpe.940
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
A combination of several contemporary techniques is used for the efficient parallel solution of the mixed finite element systems on locally refined Grids. Implementation experience and numerical results are reported. Copyright © 2005 John Wiley & Sons, Ltd.
CPE956:JAC: declarative Java concurrency
- Author(s):Max Haustein,Klaus-Peter Löhr
- Institut für Informatik, Freie Universität Berlin, Takustrasse 9, D-14195 Berlin, Germany,
- http://dx.doi.org/10.1002/cpe.956
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
The Java programming language has a low-level concurrency model which is hard to use and does not blend well with inheritance. JAC is an extension of Java that introduces a higher level of concurrency, hiding threads and separating thread synchronization from application logic in a declarative fashion. The emphasis is on limiting the differences between sequential and concurrent code, thus furthering code reuse, and on avoiding inheritance anomalies. This is achieved by taking a middle road between concurrent code on the one hand and complete separation of sequential application logic from concurrency mechanisms on the other. An extensive comparison with related approaches is given for motivating our design decisions. Copyright © 2005 John Wiley & Sons, Ltd.
CPE964:Special Issue: Middleware for Grid Computing
- Author(s):Bruno Schulze,Radha Nandkumar
- Distributed Scientific Computing Group, National Lab for Scientific Computing (LNCC), Brazil,National Center for Supercomputing Applications NCSA, University of Illinois Urbana-Champaign (UIUC), U.S.A.
http://dx.doi.org/10.1002/cpe.964
CCPE Title/Author Summary
CCPE Metadata
Abstract:
No abstract
CPE973:Resource allocation for remote desktop sessions in Utility Grids
- Author(s):Vanish Talwar,Bikash Agarwalla,Sujoy Basu,Raj Kumar,Klara Nahrstedt
- Hewlett-Packard Labs, Palo Alto, CA 94304, U.S.A.,Georgia Institute of Technology, Atlanta, GA 30332, U.S.A.,University of Illinois at Urbana Champaign, Urbana, IL 61801, U.S.A.
http://dx.doi.org/10.1002/cpe.973
CCPE Title/Author Summary
CCPE Metadata
Abstract:Emerging large-scale utility computing systems such as Grids promise computing and storage to be provided to end users as a utility. System management services deployed in the middleware are a key to enabling this vision. Utility Grids provide a challenge in terms of scale, dynamism and heterogeneity of resources and workloads. In this paper, we present a model-based architecture for resource allocation services for Utility Grids. The proposed service is built in the context of interactive remote desktop session workloads and takes application performance QoS models into consideration. The key design guidelines are hierarchical request structure, application performance models, remote desktop session performance models, site admission control, multi-variable resource assignment system and runtime session admission control. We have also built a simulation framework that can handle mixed batch and remote desktop session requests, and have implemented our proposed resource allocation service into the framework. We present some results from experiments using the framework. Our proposed architecture for resource allocation services addresses the needs of emerging utility computing systems and captures the key
CPE974:A Grid service broker for scheduling e-Science applications on global data Grids
- Author(s):Srikumar Venugopal,Rajkumar Buyya,Lyle Winton
- Grid Computing and Distributed Systems Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Australia,Experimental Particle Physics Group, School of Physics, The University of Melbourne, Australia
http://dx.doi.org/10.1002/cpe.974
CCPE Title/Author Summary
CCPE Metadata
Abstract:
The next generation of scientific experiments and studies, popularly called e-Science, is carried out by large collaborations of researchers distributed around the world engaged in the analysis of huge collections of data generated by scientific instruments. Grid computing has emerged as an enabler for e-Science as it permits the creation of virtual organizations that bring together communities with common objectives. Within a community, data collections are stored or replicated on distributed resources to enhance storage capability or the efficiency of access. In such an environment, scientists need to have the ability to carry out their studies by transparently accessing distributed data and computational resources. In this paper, we propose and develop a Grid broker that mediates access to distributed resources by: (a) discovering suitable data and computational resources sources for a given analysis scenario; (b) optimally mapping analysis jobs to resources; (c) deploying and monitoring job execution on selected resources; (d) accessing data from local or remote data sources during job execution; and (e) collating and presenting results. The broker supports a declarative and dynamic parametric programming model for creating Grid applications. We have used this model in Grid-enabling a high-energy physics analysis application (the Belle Analysis Software Framework). The broker has been used in deploying Belle experimental data analysis jobs on a Grid testbed, called the Belle Analysis Data Grid, having resources distributed across Australia interconnected through GrangeNet. Copyright © 2005 John Wiley & Sons, Ltd.
CPE965:An EasyGrid portal for scheduling system-aware applications on computational Grids
- Author(s):C. Boeres,A. A. Fonseca,H. A. Mendes,L. T. Menezes,N. T. Moura,J. A. Silva,B. A. Vianna,V. E. F. Rebello
- Instituto de Computação, Universidade Federal Fluminense (UFF), Brazil,
- http://dx.doi.org/10.1002/cpe.965
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
One of the objectives of computational Grids is to offer applications the collective computational power of distributed but typically shared heterogeneous resources. Unfortunately, efficiently harnessing the performance potential of such systems (i.e. how and where applications should execute on the Grid) is a challenging endeavor due principally to the very distributed, shared and heterogeneous nature of the resources involved. A crucial step towards solving this problem is the need to identify both an appropriate scheduling model and scheduling algorithm(s). This paper presents a tool to aid the design and evaluation of scheduling policies suitable for efficient execution of system-aware parallel applications on computational Grids. Copyright © 2005 John Wiley & Sons, Ltd.
CPE966:Checkpointing BSP parallel applications on the InteGrade Grid middleware
- Author(s):Raphael Y. de Camargo,Andrei Goldchleger,Fabio Kon,Alfredo Goldman
- Department of Computer Science, University of São Paulo, Rua do Matão, 1010, 05508-090 São Paulo, SP, Brazil,
- http://dx.doi.org/10.1002/cpe.966
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
InteGrade is a Grid middleware infrastructure that enables the use of idle computing power from user workstations. One of its goals is to support the execution of long-running parallel applications that present a considerable amount of communication among application nodes. However, in an environment composed of shared user workstations spread across many different LANs, machines may fail, become inaccessible, or may switch from idle to busy very rapidly, compromising the execution of the parallel application in some of its nodes. Thus, to provide some mechanism for fault tolerance becomes a major requirement for such a system. In this paper, we describe the support for checkpoint-based rollback recovery of Bulk Synchronous Parallel applications running over the InteGrade middleware. This mechanism consists of periodically saving application state to permit the application to restart its execution from an intermediate execution point in case of failure. A precompiler automatically instruments the source code of a C/C++ application, adding code for saving and recovering application state. A failure detector monitors the application execution. In case of failure, the application is restarted from the last saved global checkpoint. Copyright © 2005 John Wiley & Sons, Ltd.
CPE967:Structured process execution middleware for Grid computing
- Author(s):F. R. L. Cicerre,E. R. M. Madeira,L. E. Buzato
- Institute of Computing, State University of Campinas, Brazil,
- http://dx.doi.org/10.1002/cpe.967
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Grid computing is a model for wide-area distributed and parallel computing across heterogeneous networks in multiple administrative domains. It strives to provide breakthrough computing power at low cost. Nowadays there are dozens of academic and commercial products that allow execution of isolated tasks on Grids, but few products support the coordination of long-running processes in a distributed fashion. In order to address the subject, this paper presents a programming model and a middleware that support the hierarchical execution of structured processes using available nodes in a Grid environment. Their advantages are adaptable and structured coordination of activities, with better execution scalability, performance, reliability and easy monitoring. This paper also presents results that demonstrate the efficiency of this structured model, supporting dynamic adaptation of process execution through the use of an application that searches for prime numbers. Copyright © 2005 John Wiley & Sons, Ltd.
CPE968:Virtual data Grid middleware services for data-intensive science
- Author(s):Yong Zhao,Michael Wilde,Ian Foster,Jens Voeckler,James Dobson,Eric Gilbert,Thomas Jordan,Elizabeth Quigg
- Department of Computer Science, University of Chicago, Chicago, IL 60637, U.S.A.,Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439, U.S.A.,Department of Psychological and Brain Sciences, Dartmouth College, Hanover, NH 03955, U.S.A.,Fermi National Accelerator Laboratory, Batavia, IL 60510, U.S.A.,
- http://dx.doi.org/10.1002/cpe.968
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
The GriPhyN virtual data system provides a suite of components and services for data-intensive sciences that enables scientists to systematically and efficiently describe, discover, and share large-scale data and computational resources. We describe the design and implementation of such middleware services in terms of a virtual data system interface called Chiron, and present virtual data integration examples from the QuarkNet education project and from functional-MRI-based neuroscience research. The Chiron interface also serves as an online ‘educator’ for virtual data applications. Copyright © 2005 John Wiley & Sons, Ltd.
CPE969:Building reliable and efficient data transfer and processing pipelines
- Author(s):T. Kosar,G. Kola,M. Livny
- Computer Sciences Department, University of Wisconsin-Madison, 1210 West Dayton Street, Madison, WI 53706, U.S.A.,
- http://dx.doi.org/10.1002/cpe.969
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Scientific distributed applications have an increasing need to process and move large amounts of data across wide area networks. Existing systems either closely couple computation and data movement, or they require substantial human involvement during the end-to-end process. We propose a framework that enables scientists to build reliable and efficient data transfer and processing pipelines. Our framework provides a universal interface to different data transfer protocols and storage systems. It has sophisticated flow control and recovers automatically from network, storage system, software and hardware failures. We successfully used data pipelines to replicate and process three terabytes of DPOSS astronomy image dataset and several terabytes of WCER educational video dataset. In both cases, the entire process was performed without any human intervention and the data pipeline recovered automatically from various failures. Copyright © 2005 John Wiley & Sons, Ltd.
CPE970:An adaptive parallel query processing middleware for the Grid
- Author(s):V. F. V. Da Silva,M. L. Dutra,F. Porto,B. Schulze,A. C. Barbosa,J. C. de Oliveira
- Computer Science Department, National Laboratory for Scientific Computation, Rio de Janeiro, Brazil,EPFL, School of Computer and Communication Sciences, Database Laboratory, Lausanne, Switzerland,Computer Science Department, Federal University of Espírito Santo, Espírito Santo, Brazil,
- http://dx.doi.org/10.1002/cpe.970
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Grid services provide an important abstract layer on top of heterogeneous components (hardware and software) that take part in a Grid environment. In this scenario, applications such as scientific visualization require access to data of non-conventional data types, such as fluid path geometry, and the evaluation of special user programs and algebraic operators, such as spatial hash-join, on these data. In order to support such applications we are developing a Configurable Data Integration Middleware System for the Grid (CoDIMS-G). CoDIMS-G provides a query execution environment adapted to the heterogeneity and variations found in a Grid environment by offering a node scheduling algorithm and an adaptive query execution strategy. The latter both adapts to performance variations in a scheduled node and deals efficiently with repetitive evaluation of a query execution plan fragment, as needed for computing a particle's, trajectory. Copyright © 2005 John Wiley & Sons, Ltd.
CPE971:IQ-Services: network-aware middleware for interactive large-data applications
- Author(s):Zhongtang Cai,Greg Eisenhauer,Qi He,Vibhore Kumar,Karsten Schwan,Matthew Wolf
- College of Computing, Georgia Institute of Technology, 801 Atlantic Drive, Atlanta, GA 30332, U.S.A.,
- http://dx.doi.org/10.1002/cpe.971
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
IQ-Services are application-specific, resource-aware code modules executed by data transport middleware. They constitute a ‘thin’ layer between application components and the underlying computational and communication resources. This layer implements the data manipulations necessary to permit wide-area collaborations to proceed smoothly in the presence of dynamic resource variations. IQ-Services interact with the application and resource layers via dynamic performance attributes, and end-to-end implementations of such attributes also permit clients to interact with data providers. The joint middleware/resource and provider/consumer interactions implemented with performance attributes may be used to realize effective methods for managing the data flows in the large-data, distributed Grid applications targeted by our research. Experimental results in this paper demonstrate substantial performance improvements. These are attained by coordinating network-level with service-level adaptations of the data being transported and by permitting end users to dynamically deploy and use application-specific services for manipulating data in ways suitable for their current needs. Copyright © 2005 John Wiley & Sons, Ltd.
CPE972:A static resource allocation framework for Grid-based streaming applications
- Author(s):Liang Chen,Gagan Agrawal
- Department of Computer Science and Engineering, Ohio State University, Columbus, OH 43210, U.S.A.,
- http://dx.doi.org/10.1002/cpe.972
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
A number of applications increasingly rely on, or can potentially benefit from, analysis and monitoring of data streams. To support the processing of streaming data in a Grid environment, we have been developing a middleware system called GATES (Grid-based AdapTive Execution on Streams). Our target applications are those involving-volume data streams and requiring distributed processing of data arising from a distributed set of sources. This paper addresses the problem of resource allocation in the GATES system. Although resource discovery and resource allocation have been active topics in Grid community, the pipelined processing and real-time constraint required by distributed streaming applications pose new challenges. We present a resource allocation algorithm that is based on minimal spanning trees. We evaluate the algorithm experimentally and demonstrate that it results in configurations that are very close to optimal, and significantly better than most other possible configurations. Copyright © 2005 John Wiley & Sons, Ltd.
CPE957:A replication framework for program-to-program interaction across unreliable networks and its implementation in a servlet container
- Author(s):Alberto Bartoli,Milan Prica,Etienne Antoniutti di Muro
- Dipartimento di Elettrotecnica, Elettronica, Informatica, University of Trieste, Via Valerio 10, 34100 Trieste, Italy,
- http://dx.doi.org/10.1002/cpe.957
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
We propose a service replication framework for unreliable networks. The service exhibits the same consistency guarantees about the order of execution of operation requests as its non-replicated implementation. Such guarantees are preserved in spite of server replica failure or network failure (either between server replicas or between a client and a server replica), and irrespective of when the failure occurs. Moreover, the service guarantees that in the case when a client sends an ‘update’ request multiple times, there is no risk that the request be executed multiple times. No hypotheses about the timing retransmission policy of clients are made, e.g. the very same request might even arrive at different server replicas simultaneously. All of these features make the proposed framework particularly suitable for interaction between remote programs, a scenario that is gaining increasing importance. We discuss a prototype implementation of our replication framework based on Tomcat, a very popular Java-based Web server. The prototype comes into two flavors: replication of HTTP client session data and replication of a counter accessed as a Web service. Copyright © 2005 John Wiley & Sons, Ltd.
CPE958:Applying fuzzy logic and genetic algorithms to enhance the efficacy of the PID controller in buffer overflow elimination for better channel response timeliness over the Internet
- Author(s):Wilfred W. K. Lin,Allan K. Y. Wong,Richard S. L. Wu
- Department of Computing, Hong Kong Polytechnic University, Hong Kong SAR,
- http://dx.doi.org/10.1002/cpe.958
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
In this paper two novel intelligent buffer overflow controllers: the fuzzy logic controller (FLC) and the genetic algorithm controller (GAC) are proposed. In the FLC the extant algorithmic PID controller (PIDC) model, which combines the proportional (P), derivative (D) and integral (I) control elements, is augmented with fuzzy logic for higher control precision. The fuzzy logic divides the PIDC control domain into finer control regions. Every region is then defined either by a fuzzy rule or a ‘don't care’ state. The GAC combines the PIDC model with the genetic algorithm, which manipulates the parametric values of the PIDC as genes in a chromosome. The FLC and GAC operations are based on the objective function $\{0,\Delta\}^2$. The principle is that the controller should adaptively maintain the safety margin $\Delta$ around the chosen reference point (represent by the ‘0’ of $\{0,\Delta\}^2$) at runtime. The preliminary experimental results for the FLC and GAC prototypes indicate that they are both more effective and precise than the PIDC. After repeated timing analyses with the Intel's VTune Performer Analyzer, it was confirmed that the FLC can better support real-time computing than the GAC because of its shorter execution time and faster convergence without any buffer overflow. Copyright © 2005 John Wiley Sons, Ltd.
CPE959:A study into the feasibility of using two parallel sparse direct solvers for the Helmholtz equation on Linux clusters
- Author(s):G. Z. M. Berglund,S. W. de Leeuw
- Computational Physics Group, Physical Chemistry and Molecular Thermodynamics, DelftChemTech, Delft University of Technology, Julianalaan 136, 2628 BL Delft, The Netherlands,
- http://dx.doi.org/10.1002/cpe.959
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Two state-of-the-art parallel software packages for the direct solution of sparse linear systems based on LU-decomposition, MUMPS and SuperLU_DIST have been tested as black-box solvers on problems derived from finite difference discretizations of the Helmholtz equation. The target architecture has been Linux clusters, for which no consistent set of tests of the algorithms implemented in these packages has been published. The investigation consists of series of memory and time scalability checks and has focused on examining the applicability of the algorithms when processing very large sparse matrices on Linux cluster platforms. Special emphasis has been put on monitoring the behaviour of the packages when the equation systems need to be solved for multiple right-hand sides, which is the case, for instance, when modelling a seismic survey. The outcome of the tests points at poor efficiency of the tested algorithms during application of the LU-factors in the solution phase on this type of architecture, where the communication acts as an impasse. Copyright © 2005 John Wiley & Sons, Ltd.
CPE960:Distributed loop-scheduling schemes for heterogeneous computer systems
- Author(s):Anthony T. Chronopoulos,Satish Penmatsa,Jianhua Xu,Siraj Ali
- Department of Computer Science, University of Texas at San Antonio, 6900 N. Loop 1604 West, San Antonio, TX 78249, U.S.A.,Lucent Technologies, 101 Crawfords Corner Rd, Holmdel, NJ 07733, U.S.A.,
- http://dx.doi.org/10.1002/cpe.960
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Distributed computing systems are a viable and less expensive alternative to parallel computers. However, a serious difficulty in concurrent programming of a distributed system is how to deal with scheduling and load balancing of such a system which may consist of heterogeneous computers. Some distributed scheduling schemes suitable for parallel loops with independent iterations on heterogeneous computer clusters have been designed in the past. In this work we study self-scheduling schemes for parallel loops with independent iterations which have been applied to multiprocessor systems in the past. We extend one important scheme of this type to a distributed version suitable for heterogeneous distributed systems. We implement our new scheme on a network of computers and make performance comparisons with other existing schemes. Copyright © 2005 John Wiley & Sons, Ltd.
CPE961:Transparent access to Grid resources for user software
- Author(s):Sander Klous,Jaime Frey,Se-Chang Son,Douglas Thain,Alain Roy,Miron Livny,Jo van den Brand
- NIKHEF, P.O. Box 41882, 1009 DB Amsterdam, The Netherlands,Computer Science Department, University of Wisconsin, 1210 W. Dayton Street, Madison, WI 53706-1685, U.S.A.,
- http://dx.doi.org/10.1002/cpe.961
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Grid computing promises access to large amounts of computing power, but so far adoption of Grid computing has been limited to highly specialized experts for three reasons. First, users are used to batch systems, and interfaces to Grid software are often complex and different to those in batch systems. Second, users are used to having transparent file access, which Grid software does not conveniently provide. Third, efforts to achieve wide-spread coordination of computers while solving the first two problems is hampered when clusters are on private networks. Here we bring together a variety of software that allows users to almost transparently use Grid resources as if they were local resources while providing transparent access to files, even when private networks intervene. As a motivating example, the BaBar Monte Carlo production system is deployed on a truly distributed environment, the European DataGrid, without any modification to the application itself. Copyright © 2005 John Wiley & Sons, Ltd.
CPE975:Special Issue: First International Workshop on Emerging Technologies for Next-generation GRID (ETNGRID 2004)
- Author(s):Angelo Corsaro,Corrado Santoro
- SELEX SI-Strategic and Technological Planning, Roma, Italy,Dipartimento di Ingegneria Informatica e delle Telecomunicazioni, Università di Catania, Italy
http://dx.doi.org/10.1002/cpe.975
CCPE Title/Author Summary
CCPE Metadata
Abstract:
No abstract
CPE984:Using the Grid paradigm for multimedia applications
- Author(s):Angelo Zaia ,Dario Bruneo,Antonio Puliafito
- Department of
Mathematics, University of Messina, C. da Papardo
Salita Sperone 31, 98166 Messina, Italy,
- http://dx.doi.org/10.1002/cpe.984
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:Very popular mobile devices such as
cellular phones, laptops, and handheld and tablet PCs are
becoming more and more powerful. One of today's trends
is to access multimedia services from this sort of device.
Their low capacity in terms of storage, and their high
inclination to wireless connection, suggest the use of
streaming techniques instead of media download. Mobile
devices are, at present, dramatically unhomogeneous for
visualization and audio reproduction characteristics.
Consequently, today multimedia delivery systems are very
customized for some device profiles or for wireless
connection types. Transcoding techniques are used in order
to adapt the same media source to the multiple hardware
profiles. Client-based transcoding techniques show their
weakness in high energy consumption, and server-based
transcoding techniques suffer from scalability problems. In
this paper we propose a scalable distributed multimedia
server based on the Grid computing paradigm, which can adapt
media content to the device profile and/or to the connection
link. Copyright ? 2005 John Wiley & Sons, Ltd.
CPE985:Designing Grid services for multimedia streaming in an e-learning environment
- Author(s):M. Amoretti,R. Bertolazzi,M. Reggiani,F. Zanichelli,G. Conte
- Dip. di Ingegneria dell'Informazione, Università degli Studi di Parma, Parco Area delle Scienze, 181A, 43100 Parma, Italy,
- http://dx.doi.org/10.1002/cpe.985
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Next generation e-learning platforms will support cooperative use of geographically distributed educational resources as an aggregated environment, thus enabling a more effective knowledge exchange. Sharing this goal, our research activity addresses the definition and implementation of a service-based infrastructure for content distribution and multimedia streaming. The proposed architecture provides enough flexibility, extensibility, and scalability to cope with the ever-increasing heterogeneity and mobility of edge devices. In this paper, we initially illustrate the general objectives and requirements in the development of an e-learning oriented application for multimedia content discovery, access, and distribution in a virtual community. Architectural considerations have motivated the use of Grid technologies as they provide access to resources and services of different administrative domains in a transparent, seamless, and secure way. The Grid-based architecture has been endowed with a number of services including discovery and streaming of multimedia objects, multimedia content update, quality of service (QoS) management, and support for user authentication and authorization. A multimedia application based on the architecture is described and evaluated on a multi-domain network. Copyright © 2005 John Wiley & Sons, Ltd.
CPE976:Performance analysis of high-performance file-transfer systems for Grid applications
- Author(s):Cosimo Anglano,Massimo Canonico
- Dipartimento di Informatica, Università del Piemonte Orientale, Alessandria, Italy,
- http://dx.doi.org/10.1002/cpe.976
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Data-intensive Grid applications require the availability of tools able to transfer very large files in the shortest amount of time. Many file-transfer tools, based on solutions aimed at overcoming the limitations imposed by the TCP protocol, have recently been developed. In this paper we experimentally compare the performance of some of these tools in various network scenarios by running experiments on PlanetLab, an open platform for the development, deployment, and access of planetary-scale services, that comprises hundreds of hosts scattered across the globe. Our results show that solutions based on UDP and adopting rate-based algorithms result in better performance than other alternatives in most cases, while solutions based on TCP achieve similar performance only under specific circumstances. Copyright © 2005 John Wiley & Sons, Ltd.
CPE977:Reputation-based semantic service discovery
- Author(s):Ali Shaikh Ali,Shalil Majithia,Omer F. Rana,David W. Walker
- School of Computer Science, Cardiff University, Queen's Buildings, 5 The Parade, Cardiff CF24 3AA, U.K.,
- http://dx.doi.org/10.1002/cpe.977
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
An important component of Semantic Grid services is the support for dynamic service discovery. Dynamic service discovery requires the provision of rich and flexible metadata that is not supported by current registry services such as UDDI. We present a framework to facilitate reputation-based service selection in Semantic Grids. Our framework has two key features that distinguish it from other work in this area. First, we propose a dynamic, adaptive, and highly fault-tolerant reputation-aware service discovery algorithm. Second, we present a service-oriented distributed reputation assessment algorithm. In this paper, we describe the main components of our framework and report on our experience of developing the prototype. Copyright © 2005 John Wiley & Sons, Ltd.
CPE978:An approach to the quantitative evaluation of Grid services
- Author(s):Sergio Andreozzi,Paolo Ciancarini,Danilo Montesi,Rocco Moretti
- INFN-CNAF, 40127 Bologna, Italy,Department of Computer Science, University of Bologna, 40127 Bologna, Italy,Department of Mathematics and Informatics, University of Camerino, 62032 Camerino, Italy,
- http://dx.doi.org/10.1002/cpe.978
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
In the context of the progressive incarnation of Grid systems in terms of a Service Oriented Architecture, it is essential to improve the automatic evaluation and selection of Grid services. Current mechanisms for service evaluation lack expressiveness as regards the representation of service requesters' expectations. In this paper, we present a model for the quantitative expression of service attributes, for the association of the possible values of these attributes with the requester satisfaction and for the aggregation of a set of satisfactions in an overall score by means of different aggregation logics. The proposed approach enriches the expressiveness of the mechanisms for the evaluation of Grid services. Copyright © 2005 John Wiley & Sons, Ltd.
CPE979:Price-sensitive resource brokering with the Hybrid Pricing Model and widely overlapping price domains
CPE980:Supporting resource reservation and allocation for unaware applications in Grid systems
- Author(s):Antonella Di Stefano,Marco Fargetta,Giuseppe Pappalardo,Emiliano Tramontana
- Dipartimento di Ingegneria Informatica e Telecomunicazioni, Università di Catania, Italy,Dipartimento di Matematica e Informatica, Università di Catania, Italy,
- http://dx.doi.org/10.1002/cpe.980
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
The dynamics of resource request rates in a Grid system can be wide ranging, to the point that request peaks for a single resource can be difficult to handle and end up greatly increasing the response time. Once a request has been submitted by a client, this has to cope with the potential overload arising. However, it is impractical to cure overload once it takes place by negotiating a different service or finding an equivalent resource, since the client would then bear the delay due to negotiation and re-submission. Instead, in order to effectively exploit Grid resources, it is crucial that applications perform reservation of resources before using them. Reservation allows a management system to consider application needs in advance and take suitable action to improve resource availability. In particular, this enables additional resources to be secured beforehand in the background when appropriate to avoid a potential overload, rather than paying the involved costs when overload arises. This paper proposes a software architecture that integrates applications with Globus services to conveniently handle resource reservation and allocation. Within the architecture, the computational reflection technology transparently connects applications with components that take care of advance reservation, as they dynamically sense the applications' resource needs. This dynamic information augments static knowledge gathered offline from static program code analysis. Copyright © 2005 John Wiley & Sons, Ltd.
CPE981:A component-based middleware framework for configurable and reconfigurable Grid computing
- Author(s):Geoff Coulson,Paul Grace,Gordon Blair,Wei Cai,Chris Cooper,David Duce,Laurent Mathy,Wai Kit Yeung,Barry Porter,Musbah Sagar,Wei Li
- Computing Department, Lancaster University, Lancaster LA1 4YR, U.K.,Department of Computing, Oxford Brookes University, U.K.,
- http://dx.doi.org/10.1002/cpe.981
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Significant progress has been made in the design and development of Grid middleware which, in its present form, is founded on Web services technologies. However, we argue that present-day Grid middleware is severely limited in supporting projected next-generation applications which will involve pervasive and heterogeneous networked infrastructures, and advanced services such as collaborative distributed visualization. In this paper we discuss a new Grid middleware framework that features (i) support for advanced network services based on the novel concept of pluggable overlay networks, (ii) an architectural framework for constructing bespoke Grid middleware platforms in terms of ‘middleware domains’ such as extensible interaction types and resource discovery. We believe that such features will become increasingly essential with the emergence of next-generation e-Science applications. Copyright © 2005 John Wiley & Sons, Ltd.
CPE982:Dynamic Grid tasks composition and distribution through agents
- Author(s):A. Negri,A. Poggi,M. Tomaiuolo,P. Turci
- Dipartimento di Ingegneria dell'Informazione, Università degli Studi di Parma, 43100 Parma, Italy,
- http://dx.doi.org/10.1002/cpe.982
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
This paper presents a multi-agent system called GAIN (Grid Agent Infrastructure), which can be used for the development of flexible agent-based Grid systems. The system supports users both in the development and execution of Grid applications. In particular, GAIN allows the definition of workflow applications by composing different tasks made available by the Grid nodes. Furthermore, it follows the different phases of the execution of the workflow providing transparent allocation and re-allocation of the tasks on the different nodes of the Grid. A first prototype of the system has been realized by using the JADE agent development software and it has been tested in lab trials involving a network of different JADE platforms. In these trials, tasks provided both by the agents of the system and by external legacy software systems have been composed. Copyright © 2005 John Wiley & Sons, Ltd.
CPE983:Next-generation Grids: requirements and
knowledge-based services
- Author(s):Mario Cannataro
- Correspondence to Mario
Cannataro, University Magna Gr?cia of Catanzaro,
Campus of Germaneto, Viale Europa, 88100 Catanzaro, Italy
http://dx.doi.org/10.1002/cpe.983
CCPE Title/Author Summary
CCPE Metadata
Abstract:To be effectively adopted in different
application domains, next-generation Grids need to address
different issues such as: an increasing complexity and
distribution of applications; different goals, skills and
habits of Grid users; availability of different programming
and deployment models; heterogeneous capabilities and
performances of access networks and devices. Moreover,
scientific and commercial applications, as well as Grid
middleware, will increasingly produce an overwhelming
quantity of application and usage data. Although the ongoing
convergence between Grids, Web Services, and the Semantic
Web constitutes a milestone towards a service-oriented Grid
architecture, which has the potential to face important
issues such as application programming and business
modelling, many other issues need research and development
efforts. The great availability of data and information at
the different layers of Grids, the maturity of data
exploration techniques able to extract and synthesize
knowledge, such as data mining, text summarization, semantic
modelling, and knowledge management, and the demand for
intelligent services in different phases of application life
cycle are the driving forces towards novel knowledge-based
Grid services. Guided by those considerations, the paper
first introduces main requirements of next-generation Grids
and then describes some representative knowledge-based Grid
services for both applications support and system
management. Simple cases study showing how such services
could be employed are discussed. Copyright @ 2005 John Wiley
& Sons, Ltd.
CPE1005:An abridged version of this work has appeared in [1]
- Author(s):Hezi Azatchi,Erez Petrank
- IBM Haifa Research Labs, Haifa University Campus, Mount Carmel, Haifa 31905, Israel,Department of Computer Science, Technion-Israel Institute of Technology, Haifa 32000, Israel
http://dx.doi.org/10.1002/cpe.1005
CCPE Title/Author Summary
CCPE Metadata
Abstract:
We propose the use of generations with modern reference counting. A reference counting collector is well suited to collect the old generation, containing a large fraction of live objects that are modified infrequently. Such a collector can be combined with a tracing collector to collect the young generation, typically containing a small fraction of live objects. We have designed such a collector appropriate for running on a multiprocessor. As our building blocks, we used the sliding-views on-the-fly collectors. We have implemented the new collector on the Jikes Research Java Virtual Machine (Jikes RVM) and compared it with the concurrent reference counting collector supplied with the Jikes RVM package. Our measurements demonstrate short pause times, retaining those of the original on-the-fly collectors and a gain in application throughput time. It turns out that a modern reference counting collector may benefit from the use of generations. Copyright © 2006 John Wiley & Sons, Ltd.
CPE1009:Multimedia vectorization of floating-point MIN/MAX reductions
- Author(s):Aart J. C. Bik,Xinmin Tian,Milind B. Girkar
- Software and Solutions Group, Intel Corporation, 3600 Juliette Lane, Santa Clara, CA 95054, U.S.A.,
- http://dx.doi.org/10.1002/cpe.1009
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Finding the minimum or maximum value in an array forms an important step in a variety of applications. This paper discusses vectorization schemes that take advantage of the streaming-SIMD-extensions in commonly used floating-point MIN and MAX reductions. Performance advantages are demonstrated with experimental results. Copyright © 2006 John Wiley & Sons, Ltd.
CPE962:Crunching real data on the Grid: practice and experience with the European DataGrid
- Author(s):D. Groep,J. Templon,C. Loomis
- NIKHEF, P.O. Box 41882, 1009 DB Amsterdam, The Netherlands,Laboratoire de l'Accélérator Linéaire (LAL), Université Paris-Sud, Bâtiment 200, 91898 Orsay Cedex, France
http://dx.doi.org/10.1002/cpe.962
CCPE Title/Author Summary
CCPE Metadata
Abstract:
The D0 experiment has used the European DataGrid (EDG) testbed to reprocess real data obtained from the Tevatron collider at the Fermi National Accelerator Laboratory. Pushing the use of the EDG software beyond feasibility studies has produced a set of recommendations for authors of experiment-level software, for producers of middleware and for designers of Grid systems. This paper describes the D0 experience with the EDG software and the resulting recommendations. Copyright © 2005 John Wiley & Sons, Ltd.
CPE963:A new task scheduling method for distributed programs that require memory management
- Author(s):Hiroshi Koide,Yuji Oie
- Department of Artificial Intelligence, Faculty of Computer Science and Systems Engineering, Kyushu Institute of Technology, 680-4 Kawazu, Iizuka-city, Fukuoka 820-8502, Japan,
- http://dx.doi.org/10.1002/cpe.963
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
In parallel and distributed applications, it is very likely that object-oriented languages, such as Java and Ruby, and large-scale semistructured data written in XML will be employed. However, because of their inherent dynamic memory management, parallel and distributed applications must sometimes suspend the execution of all tasks running on the processors. This adversely affects their execution on the parallel and distributed platform. In this paper, we propose a new task scheduling method called CP/MM (Critical Path/Memory Management) which can efficiently schedule tasks for applications requiring memory management. The underlying concept is to consider the cost due to memory management when the task scheduling system allocates ready (executable) coarse-grain tasks, or macro-tasks, to processors. We have developed three task scheduling modules, including CP/MM, for a task scheduling system which is implemented on a Java RMI (Remote Method Invocation) communication infrastructure. Our experimental results show that CP/MM can successfully prevent high-priority macro-tasks from being affected by the garbage collection arising from memory management, so that CP/MM can efficiently schedule distributed programs whose critical paths are relatively long. Copyright © 2005 John Wiley & Sons, Ltd.
CPE1000:Automatic Grid workflow based on imperative programming languages
- Author(s):Raül Sirvent,Josep M. Pérez,Rosa M. Badia,Jesús Labarta
- Barcelona Supercomputing Center, Centro Nacional de Supercomputación, Campus Nord, Modul D6, c/ Jordi Girona 1-3, 08034 Barcelona, Spain,
- http://dx.doi.org/10.1002/cpe.1000
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
GRID superscalar is a Grid programming environment that enables one to parallelize the execution of sequential applications in computational Grids. The run-time library automatically builds a task data-dependence graph of the application and it can be seen as an implicit workflow system. The current interface supports C/C++ and Perl applications. The run-time library is based on Globus Toolkit 2.x using GRAM and GSIFTP services. In this document we describe the GRID superscalar basics emphasizing those aspects related to Grid workflow, in particular the flexibility of using an imperative language to describe the application. Copyright © 2005 John Wiley & Sons, Ltd.
CPE991:http://www.uab.cis.edu/hernandf/projects/gauge
- Author(s):Francisco Hernández,Purushotham Bangalore,Jeff Gray,Zhijie Guan,Kevin Reilly
- Department of Computer and Information Sciences, University of Alabama at Birmingham, Birmingham, AL 35294-1170, U.S.A.,
- http://dx.doi.org/10.1002/cpe.991
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
The Grid has proven to be a successful paradigm for distributed computing. However, constructing applications that exploit all the benefits that the Grid offers is still not optimal for both inexperienced and experienced users. Recent approaches to solving this problem employ a high-level abstract layer to ease the construction of applications for different Grid environments. These approaches help facilitate construction of Grid applications, but they are still tied to specific programming languages or platforms. A new approach is presented in this paper that uses concepts of domain-specific modeling (DSM) to build a high-level abstract layer. With this DSM-based abstract layer, the users are able to create Grid applications without knowledge of specific programming languages or being bound to specific Grid platforms. An additional benefit of DSM provides the capability to generate software artifacts for various Grid environments. This paper presents the Grid Automation and Generative Environment (GAUGE). The goal of GAUGE is to automate the generation of Grid applications to allow inexperienced users to exploit the Grid fully. At the same time, GAUGE provides an open framework in which experienced users can build upon and extend to tailor their applications to particular Grid environments or specific platforms. GAUGE employs domain-specific modeling techniques to accomplish this challenging task. Copyright © 2005 John Wiley & Sons, Ltd.
CPE992:Programming scientific and distributed workflow with Triana services
- Author(s):David Churches,Gabor Gombas,Andrew Harrison,Jason Maassen,Craig Robinson,Matthew Shields,Ian Taylor,Ian Wang
- School of Physics and Astronomy, Cardiff University, Cardiff, U.K.,Laboratory of Parallel and Distributed Systems, MTA SZTAKI, Computer and Automation Research Institute of the Hungarian Academy of Sciences, Budapest, Hungary,School of Computer Science, Cardiff University, Cardiff, U.K.,Department of Computer Science, Vrije Universiteit, Amsterdam, The Netherlands,
- http://dx.doi.org/10.1002/cpe.992
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
In this paper, we discuss a real-world application scenario that uses three distinct types of workflow within the Triana problem-solving environment: serial scientific workflow for the data processing of gravitational wave signals; job submission workflows that execute Triana services on a testbed; and monitoring workflows that examine and modify the behaviour of the executing application. We briefly describe the Triana distribution mechanisms and the underlying architectures that we can support. Our middleware independent abstraction layer, called the Grid Application Prototype (GAP), enables us to advertise, discover and communicate with Web and peer-to-peer (P2P) services. We show how gravitational wave search algorithms have been implemented to distribute both the search computation and data across the European GridLab testbed, using a combination of Web services, Globus interaction and P2P infrastructures. Copyright © 2005 John Wiley & Sons, Ltd.
CPE993:Taverna: lessons in creating a workflow environment for the life sciences
- Author(s):Tom Oinn,Mark Greenwood,Matthew Addis,M. Nedim Alpdemir,Justin Ferris,Kevin Glover,Carole Goble,Antoon Goderis,Duncan Hull,Darren Marvin,Peter Li,Phillip Lord,Matthew R. Pocock,Martin Senger,Robert Stevens,Anil Wipat,Chris Wroe
- EMBL European Bioinformatics Institute, Hinxton, Cambridge CB10 1SD, U.K.,School of Computer Science, University of Manchester, Manchester M13 9PL, U.K.,IT Innovation Centre, University of Southampton, Southampon SO16 7NP, U.K.,School of Computer Science and Information Technology, University of Nottingham, Nottingham NG8 1BB, U.K.,School of Computing Science, University of Newcastle, Newcastle NE1 7RU, U.K.,
- http://dx.doi.org/10.1002/cpe.993
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Life sciences research is based on individuals, often with diverse skills, assembled into research groups. These groups use their specialist expertise to address scientific problems. The in silico experiments undertaken by these research groups can be represented as workflows involving the co-ordinated use of analysis programs and information repositories that may be globally distributed. With regards to Grid computing, the requirements relate to the sharing of analysis and information resources rather than sharing computational power. The my Grid project has developed the Taverna Workbench for the composition and execution of workflows for the life sciences community. This experience paper describes lessons learnt during the development of Taverna. A common theme is the importance of understanding how workflows fit into the scientists' experimental context. The lessons reflect an evolving understanding of life scientists' requirements on a workflow environment, which is relevant to other areas of data intensive and exploratory science. Copyright © 2005 John Wiley & Sons, Ltd.
CPE994:Scientific workflow management and the Kepler system
- Author(s):Bertram Ludäscher,Ilkay Altintas,Chad Berkley,Dan Higgins,Efrat Jaeger,Matthew Jones,Edward A. Lee,Jing Tao,Yang Zhao
- San Diego Supercomputer Center, UC San Diego, San Diego, CA 92093, U.S.A.,National Center for Ecological Analysis and Synthesis, UC Santa Barbara, Santa Barbara, CA 93101, U.S.A.,Department of Electrical Engineering and Computer Sciences, UC Berkeley, Berkeley, CA 94720, U.S.A.,
- http://dx.doi.org/10.1002/cpe.994
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Many scientific disciplines are now data and information driven, and new scientific knowledge is often gained by scientists putting together data analysis and knowledge discovery ‘pipelines’. A related trend is that more and more scientific communities realize the benefits of sharing their data and computational services, and are thus contributing to a distributed data and computational community infrastructure (a.k.a. ‘the Grid’). However, this infrastructure is only a means to an end and ideally scientists should not be too concerned with its existence. The goal is for scientists to focus on development and use of what we call scientific workflows. These are networks of analytical steps that may involve, e.g., database access and querying steps, data analysis and mining steps, and many other steps including computationally intensive jobs on high-performance cluster computers. In this paper we describe characteristics of and requirements for scientific workflows as identified in a number of our application projects. We then elaborate on Kepler, a particular scientific workflow system, currently under development across a number of scientific data management projects. We describe some key features of Kepler and its underlying Ptolemy II system, planned extensions, and areas of future research. Kepler is a community-driven, open source project, and we always welcome related projects and new contributors to join. Copyright © 2005 John Wiley & Sons, Ltd.
CPE995:Toward a search architecture for software components
- Author(s):Fabrizio Silvestri,Diego Puppin,Domenico Laforenza,Salvatore Orlando
- HPC-Lab, ISTI-CNR, Via G. Moruzzi 1, 56124 Pisa, Italy,CS Department, University of Venice, Via Torino 155, 30172 Mestre, Italy
http://dx.doi.org/10.1002/cpe.995
CCPE Title/Author Summary
CCPE Metadata
Abstract:
The Grid and its related technologies enable large-scale sharing of resources of various types. We envision that in the near future applications will be completely built in a bottom-up fashion using software components deployed on various locations and interconnected to form a workflow graph. In this paper, we make some proposals on the design of a component search service, enabling users to locate the components they need to deploy an application. Copyright © 2005 John Wiley & Sons, Ltd.
CPE996:Choreography for the Grid: towards fitting BPEL to the resource framework
- Author(s):Frank Leymann
- IBM Software Group and University of Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, Universitätsstrasse 38, D-70569 Stuttgart, Germany
http://dx.doi.org/10.1002/cpe.996
CCPE Title/Author Summary
CCPE Metadata
Abstract:
The inherent heterogeneity of the Grid demands the ability to specify choreographies in a portable manner. This ensures that a choreography once specified can be deployed and executed in every workflow system within a Grid environment. It is likely that the Business Process Execution Language (BPEL) will have the corresponding broad support in the industry. In order to become first class citizens in the Grid, choreographies have to comply with the resource framework. We therefore suggest steps to make BPEL compliant with the resource framework. As a result, features of BPEL such as extended transactions will be available in a Grid environment. Copyright © 2005 John Wiley & Sons, Ltd.
CPE997:Refactoring service-based systems: how to avoid trusting a workflow service
- Author(s):Howard Chivers,John McDermid
- Department of Computer Science, University of York, Heslington, York YO10 5DD, U.K.,
- http://dx.doi.org/10.1002/cpe.997
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Grid systems span multiple organizations, so their workflow processes have security requirements, such as restricting access to data or ensuring that process constraints are observed. These requirements are often managed by the workflow component, because of the close association between this sub-system and the processes it enacts. However, high-quality security mechanisms and complex functionality are difficult to combine, so designers and users of workflow systems are faced with a tradeoff between security and functionality, which is unlikely to provide confidence in the security implementation. This paper resolves that tension by showing that process security can be enforced outside the workflow component. Separating security and process functionality in this way improves the quality of security protection, because it is implemented by standard system mechanisms; it also allows the workflow component to be deployed as a standard service, rather than a privileged system component. To make this change of design philosophy accessible outside the security community it is documented as a collection of refactorings, which include problem templates that identify suspect design practice, and target patterns that provide solutions. Worked examples show that these patterns can be used in practice to implement practical applications, with both traditional workflow security concerns, and Grid requirements. Copyright © 2005 John Wiley & Sons, Ltd.
CPE998:A Grid workflow infrastructure
- Author(s):Dieter Cybok
- Department of Computing, Imperial College London, 180 Queen's Gate, South Kensington Campus, London SW7 2AZ, U.K.
http://dx.doi.org/10.1002/cpe.998
CCPE Title/Author Summary
CCPE Metadata
Abstract:
In this paper we propose a Grid workflow infrastructure, which serves as the base for specifying and executing collaborative interactive workflows within computational Grids. The infrastructure is based on the Open Grid Services Architecture (OGSA) and leverages the concepts of the Business Process Execution Language for Web Services (BPEL4WS). Using OGSA enables the exploitation of advanced Grid features such as factories, lifecycle management and notifications. Leveraging BPEL4WS to a Grid enabled workflow language has the advantage that basic workflow functionalities, which are similar for Grid and Web services, do not have to be developed again. The result is a state-of-the-art Grid workflow infrastructure that was developed within a relatively short period. The main building blocks of the infrastructure are the specification of the Grid Workflow Execution Language (GWEL) notation and the implementation of a Grid workflow execution engine, using Globus Toolkit 3 (GT3) technology, for processing e-Science specific workflows specified in GWEL documents. The workflow engine itself is a high-level Grid service, hence automatically Grid aware, which can be used within any GT3 environment. Copyright © 2005 John Wiley & Sons, Ltd.
CPE999:Workflow applications in GridLab and PROGRESS projects
- Author(s):Michal Kosiedowski,Krzysztof Kurowski,Cezary Mazurek,Jarek Nabrzyski,Juliusz Pukacki
- Poznañ Supercomputing and Networking Center, Poznañ, Poland,
- http://dx.doi.org/10.1002/cpe.999
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
In this paper we present our motivations and ideas for workflow management based on our experiences gained in two projects: GridLab and PROGRESS. In these projects we have been dealing with real use cases and end users' requirements for workflow management. Therefore, we were able to define and implement functional workflow extensions to the Grid(Lab) Resource Management System (GRMS). GRMS is a resource management system with a workflow engine that executes and manages jobs on remote Grid resources. One can submit to GRMS workflow experiments based on an XML workflow schema, defining flexible mechanisms for dynamic workflow control, including various types of precedence constraints, different locations of the final data products and executables, etc. All of these features allow end users to speed up remote workflow calculations and improve data management mechanisms. Copyright © 2005 John Wiley & Sons, Ltd.
CPE1001:What makes workflows work in an opportunistic environment?
- Author(s):Ewa Deelman,Tevfik Kosar,Carl Kesselman,Miron Livny
- USC Information Science Institute, 4676 Admiralty Way, Suite 1001, Marina Del Rey, CA 90292, U.S.A.,Computer Sciences Department, University of Wisconsin-Madison, 1210 West Dayton Street, Madison, WI 53719, U.S.A.,
- http://dx.doi.org/10.1002/cpe.1001
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
In this paper, we examine the issues of workflow mapping and execution in opportunistic environments such as the Grid. As applications become ever more complex, the process of choosing the appropriate resources and successfully executing the application components becomes ever more difficult. This may include extension or reduction of the initial workflow mapping as necessary for the actual execution. In this paper, we focus on the interplay between a workflow-mapping component that plans the high-level resource assignments and the workflow executor that oversees the component execution. We concentrate particularly on issues of data management and we draw from the experiences with mapping and execution systems: Pegasus, DAGMan and Stork. Copyright © 2005 John Wiley & Sons, Ltd.
CPE1002:User tools and languages for graph-based Grid workflows
- Author(s):Andreas Hoheisel
- Fraunhofer Institute for Computer Architecture and Software Technology (FIRST), Kekuléstrasse 7, D-12489 Berlin, Germany
http://dx.doi.org/10.1002/cpe.1002
CCPE Title/Author Summary
CCPE Metadata
Abstract:
This article presents a graph-based Grid workflow language that is based on the formalism of Petri nets and the corresponding workflow enactment machine, developed by the author within the Fraunhofer Resource Grid in Germany. The workflow enactment machine supports dynamic refinement of workflows during runtime and automatic mapping of abstract jobs onto concrete Grid resources, which are accessed by means of the Globus Toolkit. Copyright © 2005 John Wiley & Sons, Ltd.
CPE1003:Implementing BPEL4WS: the architecture of a BPEL4WS implementation
- Author(s):Francisco Curbera,Rania Khalaf,William A. Nagy,Sanjiva Weerawarana
- IBM T. J. Watson Research Center, 19 Skyline Drive, Hawthorne, NY 10532, U.S.A.,
- http://dx.doi.org/10.1002/cpe.1003
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
BPEL4WS (BPEL in short) is a business process definition language built natively on top of the Web services application model. BPEL provides a workflow-oriented composition model for Web services applications, and is thus a central piece in the heavily componentized service-oriented computing model. BPEL results from the merger of two distinct process metamodels (the process algebra model of XLANG and the graph-oriented model of WSFL) into a coherent and powerful framework. Implementing BPEL thus presents significant challenges to middleware developers. This paper discusses those challenges and describes the design and architecture of the BPWS4J runtime, and a full implementation of the BPELWS 1.1 specification. Copyright © 2005 John Wiley & Sons, Ltd.
CPE1004:On using BPEL extensibility to implement OGSI and WSRF Grid workflows
- Author(s):Aleksander Slomiski
- Computer Science Department, Indiana University, Lindley Hall, Room 215, 150 South Woodlawn Avenue, Bloomington, IN 47405-7104, U.S.A.
http://dx.doi.org/10.1002/cpe.1004
CCPE Title/Author Summary
CCPE Metadata
Abstract:
This paper discusses the benefits and challenges of using BPEL4WS in Grid environments. In particular, we look at how BPEL4WS built-in extensibility can be used to facilitate execution of BPEL-based workflows in OGSI- and WSRF-based Grids. Copyright © 2005 John Wiley & Sons, Ltd.
CPE1019:Special Issue: Workflow in Grid Systems
- Author(s):Geoffrey C. Fox,Dennis Gannon
- Community Grids Laboratory, Indiana University, 501 N. Morton Suite 224, Bloomington, IN 47404, U.S.A.,Computer Science Department and School of Informatics, Lindley Hall 215, Indiana University, Bloomington, IN 47404, U.S.A.
http://dx.doi.org/10.1002/cpe.1019
CCPE Title/Author Summary
CCPE Metadata
Abstract:
No abstract
CPE988:Grid-Flow: a Grid-enabled scientific workflow system with a Petri-net-based interface
- Author(s):Zhijie Guan,Francisco Hernandez,Purushotham Bangalore,Jeff Gray,Anthony Skjellum,Vijay Velusamy,Yin Liu
- Department of Computer and Information Sciences, University of Alabama at Birmingham, 115A Campbell Hall, 1300 University Boulevard, Birmingham, AL 35294-1170, U.S.A.,
- http://dx.doi.org/10.1002/cpe.988
- CCPE Title/Author Summary
- CCPE Metadata
- Abstract:
Advances in computer technologies have enabled scientists to explore research issues in their respective domains at scales greater and finer than ever before. Th