(ISSN 0972-7272) The peer reviewed  journal

Home | Aim&Scope | Editorial Board | Author Guidelines | Publisher | Subscription | Current Issue | Contact Us |

Volume 2 Issue 2 June 2004


Detecting Anomalies in High-Performance Parallel Programs

German Florez, Zhen Liu, Susan Bridges,
Rayford Vaughn, Anthony Skjellum*

The Center for Computer Security Research
Mississippi State University
Email: {gf24, zliu, bridges, vaughn },


Message Passing Interface (MPI) is an effective programming technique for implementing parallel programs for distributed computation. As these applications run, a number of different types of irregularities can occur including those that result from intrusions, user misbehavior, corrupted data, deadlocks or failure of cluster components. In this paper, we perform a comparison of different artificial intelligence (AI) techniques that can be used to implement a lightweight monitoring and detection system for parallel applications on a cluster of Linux workstations. We study the accuracy and performance of deterministic and stochastic algorithms when we observe the flow of function library and OS system calls of parallel programs written with MPI. We demonstrate that monitoring of MPI programs can be achieved with high accuracy and in some cases with a 0% false positive rate in real-time, and we show that the added computational load on each node is small. Finally we demonstrate that simple deterministic methods perform poorly when the program flow grows in size and variety, and that more complex methods are required.

OGSA-WebDB: An OGSA-Based System for Bringing
Web Databases into the Grid

Said Mirza Pahlevi and Isao Kojima
National Institute of Advanced Industrial Science and Technology (AIST),
Grid Technology Research Center, Tsukuba, Ibaraki 305-8568, Japan
Email: {mirza, kojima}


An OGSA-based system, OGSA-WebDB, is proposed, which enables gird applications to query web databases using a standard database query language (SQL). OGSA-WebDB consists of two main components: proxy databases and a mediator. Proxy databases represent the desired web databases while the mediator acts as an interface between the proxy databases and the web databases. The mediator accepts an SQL query from local applications and transforms the query into one or more Boolean conditions that are then sent to the target web databases. The mediator processes the SQL query in parallel, taking into account the characteristics of the web databases. Experimental results revealed that the query processing time is so small that it can be ignored for timing considerations. The system has been fully implemented on top of Globus Toolkit and OGSA-DAI software components.

Early Experiences with the GRelC Library

Giovanni Aloisio, Massimo Cafaro, Sandro Fiore, Maria Mirto
Center for Advanced Computational Technologies/ISUFI, University of Lecce, Italy
Email: {giovanni.aloisio, massimo.cafaro, sandro.fiore, maria.mirto}


Today many Data Grid applications need to manage and process a very large amount of data distributed across multiple grid nodes and stored in relational databases. The Grid Relational Catalog Project (GRelC) developed at the CACT/ISUFI of the University of Lecce, represents an attempt to design and deploy a Grid-DBMS for the Globus Community. In this paper, after defining the Grid-DBMS concept, we describe the GRelC library which is layered on top of the Globus Toolkit. The user can build client applications on top of it that can easily get access to and interact with data resources.

The Grid Job Builder – Visual Modelling of Grid Jobs using Petri nets

Christoph Jung, Elias Herdt, Stefan Noll
Fraunhofer Institute for Computer Graphics, Darmstadt, Germany
Email: {cjung, eherdt, noll}


Grid computing technology has emerged from its origin in the scientific area with an increasing impact on the business world. Substantial work has been spend on improving the grid middleware but the gap between the high expectations and available real-life grid applications is still remarkable. There is a significant emerging risk of creating a new hype which may result in disillusion and disappointment. Therefore, this article emphasises the urgence of providing reliable grid-based solutions — regardless of their scientific or commercial domain - in order to get grid computing to a mature state with wide-spread acceptance. An application prototype for editing and modelling grid workflows for semi-professionals - as part of an approach for solving this problem - and a grid job example are described.

G-AQFS: Grid computing exploitation for the management of air quality in presence of
complex meteorological circulations

G. Aloisio1, M. Cafaro1, R. Cesari2, C. Mangia2, G.P. Marra1,2,*, M. Miglietta2, M. Mirto1, U. Rizza2, I. Schipa2, A. Tanzarella2

1Center for Advanced Computational Technologies/ISUFI, University of Lecce, Italy
2Institute of Atmospheric Sciences and Climate, C.N.R, Section of Lecce, Italy
1{giovanni.aloisio, massimo.cafaro, gianpaolo.marra, maria.mirto},
2{r.cesari, c.mangia, gp.marra, m.miglietta, u.rizza, i.schipa, a.tanzarella}

* To whom all correspondence should be addressed
Gian Paolo Marra
Institute of Atmospheric Sciences and Climate, C.N.R
S.P. Lecce-Monteroni, km 1,200 - 73100 Lecce (Italy)


Leveraging Grid Computing technology, i.e. the virtualization of distributed computing and data resources such as processing, network bandwidth and storage capacity to create a single system image, we present a Grid Air Quality Forecast System (G-AQFS). The Modeling system consists of meteorological and dispersion models coupled in cascade. The computational workflow of the Modeling system is defined by means of DAGs (Direct Acyclic Graph). A simple system is presented to manage and schedule the computational Grid resources. In particular, the algorithm developed for the Work Flow Scheduler named Depth-First Search Job with Priority (DFSP) is illustrated. As case study the system has been applied over Salento area, in the Apulia region (South-eastern Italy), to simulate ground level ozone concentration. Model predictions have been compared with field measurements, with reasonable results.

A Web / Grid Portal Implementation of BioSimGrid: A Biomolecular Simulation Database

Bing Wu1,2,*, Matthew Dovey2, Muan Hong Ng4, Kaihsu Tai1, Stuart Murdock3,4, Hans Fangohr4,
Steve Johnston4, Paul Jeffreys2, Simon Cox4, Jonathan W. Essex3 and Mark S.P. Sansom1

1Department of Biochemistry, 2e-Science Centre, University of Oxford,
3Department of Chemistry, 4e-Science Centre, University of Southampton
*to whom correspondence should be addressed:



The overall aim of the BioSimGrid project ( is to exploit the Grid infrastructure to enable comparative analysis of the distributed results of biomolecular simulations. In particular this paper presents the implementation of the current BioSimGrid Web Portal. The portal has a SOA (Service Oriented Architecture) framework built on the layer of OGSA (Open Grid Services Architecture) and OGSA-DAI (Open Grid Services Architecture Data Access and Integration) middleware. The PortalLib has been developed to allow RAD (Rapid Application Development) of portal applications. The portal also integrates PKI (Public Key Infrastructure) and supports two levels of distributed SSO (Single Sign On): Grid certificate-based SSO for high security, and user/password based SSO for maximal flexibility.

Efficient Matching of Events in Distributed Middleware Systems

Shrideep Pallickara and Geoffrey Fox
Community Grids Laboratory
Indiana University, IN. USA 47401
Email: {spallick,gcf}



Increasingly interactions which entities have with each other are network bound. The entities, with which applications andservices need to interact, span a wide spectrum that includes desktops, PDAs, appliances, and other networked resources. These events encapsulate information pertaining to transactions, data interchange, system conditions and finally the search, discoveryand subsequent sharing of resources. Events have internal or external (system computed) destinations associated with them. In the case of search, discovery and publish/subscribe interactions the system has to efficiently calculate destinations from the corresponding events. This computing of destinations is referred to as matching and is, in itself, a distributed process, which operates on the distributed management of client interests (advertisements and subscriptions). The distributed nature of the underlying messaging infrastructure also mandates an efficient routing engine. Inefficient approaches to either the calculation of, or routing to, destinations can result in unacceptable network degradations.

In this paper we explore matching, routing and network utilization issues in the context of NaradaBrokering, which provides support for centralized, distributed and P2P interactions. We also discuss the implications, and include results, pertaining to the different matching engines supported within the NaradaBrokering system.

Ontology-based Design of Bioinformatics Workflows on PROTEUS

Mario Cannataro1, Antonella Guzzo2, Carmela Comito2 and Pierangelo Veltri1
1 University Magna Græcia of Catanzaro, Via T. Campanella 115, Catanzaro, Italy
2 DEIS, University of Calabria, Via P. Bucci 41/c, Rende, Italy
Email: {cannataro,veltri}, {guzzo, comito}



Bioinformatics is as a bridge between life science and computer science: computer algorithms are needed to face complexity of biological processes. Bioinformatics applications manage complex biologicaldata accessing distributed heterogeneous databases, and require large computing power. After introducing bioinformatics requirements, we present the architecture of PROTEUS, a Grid-based Problem Solving Environment that integrates ontology and workflow approaches to enhance composition and execution of bioinformatics application on the Grid. A first distributed implementation of PROTEUS on Globus is also described.

Demonstrations of Collaborative Web Services and Peer-to-Peer Grids

Minjun Wang1,3, Geoffrey Fox1,2,4 and Shrideep Pallickara1
1Community Grid Computing Laboratory, Indiana University,
501 N Morton, Suite 224, Bloomington, IN 47404, U.S.A.
2Computer Science Department, Indiana University, Bloomington, IN 47404, U.S.A.
3EECS Department, Syracuse University, Syracuse, NY 13210, U.S.A.
4School of Informatics and Physics Department, Indiana University, Bloomington, IN 47404, U.S.A.



Peer-to-Peer Grids is a new trend in scientific computing and collaboration. It is based on the Peer-to-Peer and Grids technologies and leverages the advantages of both.We develop our collaborative PowerPoint and IE (Internet Explorer) applications with a common Peer-to-Peer Grid architecture. We make NaradaBrokering as our dynamic messaging environment and systematic use of Web Services as one type of our building blocks. Making PowerPoint and Internet Explorer applications collaborative using their Event Metadata and Instant Messaging as Web Services is useful in situations such as long distance education [2, 4] and web conferencing [6]. This is also a good process of demonstrations of harnessing and leveraging of the power and richness of Web Services and Peer-to-Peer Grids computing.

The Grid as an Application Service Provision enabler: Business and Architectural issues

Bill Vassiliadis1, Kostas Giotopoulos2, Kostas Votis2,3,
Spiros Likothanassis2, Nikos Bogonikolos3

1Digital Systems & Media Computing Laboratory
Hellenic Open University
Patras, Greece

2Dept. of Computer Engineering and Informatics,
University of Patras, Greece



The globalisation of trade has increased the number of competitors, driving the need for federated and networked business models. In this work we argue that next generation Application Service Provision models could benefit from the use of the Grid technology. We describe a Grid-enabled architecture for coordinated resource sharing and problem solving in dynamic, multi-institutional vendors. This solution is analysed from two perspectives: technology architecture and business ecology.

On-line Generation of Suggestions for Web Users

Fabrizio Silvestri, Ranieri Baraglia, Paolo Palmerini, and Massimo Serran‘o
Information Science and Technologies Institute (ISTI)
National Research Council, Pisa, ITALY
Email: {f.silvestri, r.baraglia, p.palmerini, m.serrano}



The knowledge extracted from the analysis of historical information of a web server can be used to develop personalization or recommendation systems. Web Usage Mining (WUM) systems are specifically designed to carry out this task by analyzing the data representing usage data about a particular Web Site. Typically these systems are composed by two parts. One, executed offline, that analyze the server access logs in order to find a suitable categorization, andanother executed online which is aimed at classifying the active requests, according to the previous offline analysis. In this paper we propose a WUM recommendation system, implemented as a module of the Apache web server, that is able to dynamically generate suggestions to pagesthat have not yet been visited by a user and might be of his potential interest. Differently from previously proposed WUM systems, SUGGEST 2.0 incrementally builds and maintain the historical information, without the need for an offline component, by means of a novel incremental graph partitioning algorithm. In the last part, we also analyze the quality of the suggestions generated and the performance of the module implemented. To this purpose we introduce also a new quality metric which try to estimate the effectiveness of a recommendation system as the capacity of anticipating users’ requests that will be made farther in the future1.

Modeling a Grid-Based Problem-Solving Environment for Mobile Devices

Stan Kurkovsky, Bhagyavati, Arris Ray
Department of Computer Science
Columbus State University
{Kurkovsky_Stan, Bhagyavati, Ray_Arris}
Contact author: Stan Kurkovsky
Mailing address: Columbus State University
Department of Computer Science
4225 University Avenue
Columbus, GA 31907


The paradigm of grid computing has been successfully applied in the domain of computationally-intensive applications supporting scientific research. Server-class computers interconnected by wired networks are typically used as computing devices in the grid. At the same time, the users of the existing and growing number of wireless mobile devices often demand more computational power than their devices can currently provide. We propose using the paradigm of the computational grid to build a problem-solving environment for wireless mobile devices. We address the challenges of distribution, coordination and assembly of a complex task, as well as such issues as network stability, access transparency and dependability in a grid-based system of mobile devices.

Home | Aim&Scope | Editorial Board | Author Guidelines | Publisher | Subscription | Current Issue | Contact Us |