Trustworthy remote compiling services for grid-based scientific applications

Grid computing, which is characterized by large-scale sharing and collaboration of dynamic resources, is becoming an emerging computing platform on a global scale for data-intensive and computation-intensive scientific application. However, the complications of large-scale scientific computations and simulations harnessing massive computing resources are compounded by extensive heterogeneity in environments arising from “the Grid.” Scientists and engineers lack an intuitive grid-based compilation tool, which has contributed to the difficulty of exploiting these diverse resources and developing their applications on the grid. While manual configuration of various toolkits simplifying the end-to-end completion of a job is adequate for a computational grid with a limited number of nodes, the compilation procedure becomes inefficient for a computational grid with an increasing number of heterogeneous computational service providers. On the other hand, a global-scale computational grid is a potentially untrustworthy computing environment. How to take advantage of the potentially untrustworthy grid resources to provide trustworthy computational services for large-scale scientific applications is another critical issue. In this article, a remote compiling service for a heterogeneous computational grid is developed. In addition to running compilation tasks, the remote compiling service provides security enforcement and validation facilities, including intermediate value checking, secure source program submission, restricted compilation, and binary inspection, to support trustworthy compilation and execution of grid-based scientific applications. Overall, it is expected that our remote compiling services on the grid can tackle the heterogeneity problem of the grid and provide a secure, trustworthy, reliable, and state-of-the-art mechanism to develop grid-aware scientific applications.

Automatically wrapping legacy software into services: A grid case study

The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing for solving large-scale data and computationally intensive problems. Peer-to-peer (P2P) systems have emerged as an infrastructure enabling technologies for enhanced scalability and reliability in file sharing and content distribution. It is envisioned that P2P enabled service-oriented grid systems would virtualize various resources as services with high scalability and reliability. Many legacy software resources exist nowadays, but making them grid aware services for effective resource sharing has become an issue of vital importance. This paper presents GSLab, a toolkit for automatically wrapping legacy software into services that can be published, discovered and reused in grid environments. GSLab employs Sun Grid Engine (SGE) to enhance its performance in execution of wrapped services. Using GSLab, we have automatically wrapped a legacy computer animation rendering code written in C as a service that can be discovered and accessed in a SGE environment. The evaluation results show that the performance of GSLab improves with an increase in the number of computing nodes involved.

Design and implementation of a workflow-based resource broker with information system on computational grids

The grid is a promising infrastructure that can allow scientists and engineers to access resources among geographically distributed environments. Grid computing is a new technology which focuses on aggregating resources (e.g., processor cycles, disk storage, and contents) from a large-scale computing platform. Making grid computing a reality requires a resource broker to manage and monitor available resources. This paper presents a workflow-based resource broker whose main functions are matching available resources with user requests and considering network information statuses during matchmaking in computational grids. The resource broker provides a graphic user interface for accessing available and the appropriate resources via user credentials. This broker uses the Ganglia and NWS tools to monitor resource status and network-related information, respectively. Then we propose a history-based execution time estimation model to predict the execution time of parallel applications, according to previous execution results. The experimental results show that our model can accurately predict the execution time of embarrassingly parallel applications. We also report on using the Globus Toolkit to construct a grid platform called the TIGER project that integrates resources distributed across five universities in Taichung city, Taiwan, where the resource broker was developed.

Defining the grid: a snapshot on the current view

The term “Grid” was introduced in early 1998 with the launch of the book “The Grid. Blueprint for a new computing infrastructure”. Since that time many technological changes have occurred in both hardware and software. One of the most important ones seems to be the wide acceptance of Web services. Although the basic Grid idea has not changed much in the last decade, many people have different ideas about what a Grid really is. In the following article we report on a survey where we invited many people in the field of Grid computing to give us their current understanding.

Access Grid technology in classroom and research environments

Global communication is essential to industry, research and education. The Access Grid (AG) is a suite of hardware, software, and tools to facilitate communication and collaboration over the Internet. These resources are used at over 500 institutions worldwide to support group-to-group interactions across the Grid including collaborative research work sessions, tutorials, lectures, large-scale distributed meetings and training. This paper will provide an overview of the technology to encourage professionals to integrate benefits and tools of the Grid into their instruction and research. Furthermore, this paper will compare this new technology to more traditional videoconferencing and distributed collaborative working environments. Lastly, it will present issues and challenges that must be addressed to incorporate this momentous technology within the classroom and for collaboration throughout the world.

A method to test concurrent systems using architectural specification

In this paper, we discuss a testing method for integration testing of complex and concurrent systems. Integration testing is considered the least well understood and hence is the most problematic level of testing related to concurrent system development. This is so, because integration testing is not completely unit (or code) neither testing nor it is completely system testing. To achieve this goal of improving integration testing, our proposed method exploits architectural specification of concurrent and distributed systems defined in the high level Petri nets, known as Hierarchical Predicate Transition Nets (HPrTNs). More specifically, our testing method implements the separation of concerns strategy to handle both the essential complexity associated with the front-end software development of inherently concurrent and distributed systems, i.e. architectural specification, and the difficulty and cost associated with the back-end development of these systems, namely, software testing.

On improving resource utilization and system throughput of master slave job scheduling in heterogeneous systems

The rapid advances of network technologies shed light on many aspects of the practicability of large scale ubiquitous computing. Grid technology has been recognized as an efficient solution to coordinate large-scale shared resources and execute complex applications in heterogeneous network environments. The problem of resource management and task allocation has always been one of the main challenges. In this paper, we present an efficient task allocation strategy for distributing tasks onto computing nodes in the underlying heterogeneous networks. The contribution of the proposed technique is to minimize average turnaround time by dispatching tasks to processors with smallest communication ratio. System throughput could be also enhanced by dispersing processor idle time. The proposed technique can be applied to heterogeneous cluster systems as well as computational grid environments, in which the communication costs vary in different clusters. Experimental results show that the proposed scheme outperforms other previous algorithms in terms of throughput and turnaround time.

The design and implementation of Visuel performance monitoring and analysis toolkit for cluster and grid environments

The computing power provided by high performance and low-cost PC-based clusters with Grid platforms are attractive and they are equal or superior to supercomputers and mainframes. In this paper, we present implementation and design rationale of Visuel toolkit for MPI parallel program performance measurement and analysis in cluster and grid environments. Most of performance visualization tools available today for high-performance platforms show solely system performance data (e.g., CPU load, memory usage, network bandwidth, server average load), and thus, being suitable for computing system activity visualization. The Visuel (Visuel (in French language) = to visualize) toolkit is web-based interface designed to show performance activities of all computing nodes of a distributed environment involved in the execution of MPI parallel program, such as CPU load level and memory usage of each computing node. In addition, this toolkit is able to display comparative performance data charts of MPI parallel applications and multiple executions under investigation. The usage of this toolkit shows that it outperforms in easing the process of investigation of parallel applications.

IPBGA: a hybrid P2P based grid architecture by using information pool protocol

The current representatives of Grid systems are Globus and Web services, however, they have poor scalability and single point failure. It is these two factors which make the building of an improved P2P and grid hybrid framework for resource management and task schedule such a popular research topic. This paper differs from current research because it puts forward an Information Pool Based Grid Architecture (IPBGA), which is a real sense hybrid of P2P and grid instead of only introducing P2P methods into grid systems for resource management. Based on virtualizations, abstract physical resources and tasks to be, the information requests from resources for tasks and appeals from tasks for resources are upgraded as information services by using an information pool protocol (IPP). Thus, grid resource management and task scheduling are regarded as information matching by IPP which is adaptive to the heterogeneous, dynamic, and distributed characteristics of a grid system. Tri-Information Center (Tri-IC) and source ranking mechanisms are presented in IPP to improve robustness, prevent sybil attack, and to discourage free riding. Experiments and theory analysis show that the IPP of the IPBGA is more efficient and robust in dealing with information while both the bandwidth and process costs are less.

A probabilistic and adaptive scheduling algorithm using system-generated predictions for inter-grid resource sharing

Rapid advancement and more readily availability of Grid technologies have encouraged many businesses and researchers to establish Virtual Organizations (VO) and make use of their available desktop resources to solve computing intensive problems. These VOs, however, work as disjointed and independent communities with no resource sharing between them. We, in previous work, have proposed a fully decentralized and reconfigurable Inter-Grid framework for resource sharing among such distributed and autonomous Grid systems (Rao et al. in ICCSA, [2006]). The specific problem that underlies in such a collaborating Grids system is scheduling of resources as there is very little knowledge about availability of the resources due to the distributed and autonomous nature of the underlying Grid entities. In this paper, we propose a probabilistic and adaptive scheduling algorithm using system-generated predictions for Inter-Grid resource sharing keeping collaborating Grid systems autonomous and independent. We first use system-generated job runtime estimates without actually submitting jobs to the target Grid system. Then this job execution estimate is used to predict the job scheduling feasibility on the target system. Furthermore, our proposed algorithm adapted itself to the actual resource behavior and performance. Simulation results are presented to discuss the correctness and accuracy of our proposed algorithm.

Exploring interoperability of language resources: the case of cross-lingual semi-automatic enrichment of wordnets

In this paper we present an application fostering the integration and interoperability of computational lexicons, focusing on the particular case of mutual linking and cross-lingual enrichment of two wordnets, the ItalWordNet and Sinica BOW lexicons. This is intended as a case-study investigating the needs and requirements of semi-automatic integration and interoperability of lexical resources, in the view of developing a prototype web application to support the GlobalWordNet Grid initiative.

Rapid goal-oriented automated software testing using MEA-graph planning

With the rapid growth in the development of sophisticated modern software applications, the complexity of the software development process has increased enormously, posing an urgent need for the automation of some of the more time-consuming aspects of the development process. One of the key stages in the software development process is system testing. In this paper, we evaluate the potential application of AI planning techniques in automated software testing. The key contributions of this paper include the following: (1) A formal model of software systems from the perspective of software testing that is applicable to important classes of systems and is amenable to automation using AI planning methods. (2) The design of a framework for an automated planning system (APS) for applying AI planning techniques for testing software systems. (3) Assessment of the test automation framework and a specific AI Planning algorithm, namely, MEA-Graphplan (Means-Ends Analysis Graphplan), algorithm to automatically generate test data. (4) A case study is presented to evaluate the proposed automated testing method and compare the performance of MEA-Graphplan with that of Graphplan. The empirical results show that for software testing, the MEA-Graphplan algorithm can perform computationally more efficiently and effectively than the basic Graph Planning algorithm.

Analytical modeling of interconnection networks in heterogeneous multi-cluster systems

The study of interconnection networks is important because the overall performance of a distributed system is often critically hinged on the effectiveness of its interconnection network. This paper addresses the problem of interconnection networks performance modeling of large-scale distributed systems with emphases on heterogeneous multi-cluster computing systems. We present an analytical model to predict message latency in multi-cluster systems in the presence of node, network and system organization heterogeneity. The model is validated through comprehensive simulation, which demonstrates that the proposed model exhibits a good degree of accuracy for various system organizations and under different working conditions.

Generic programming techniques for parallelizing and extending procedural finite element programs

We outline an approach for extending procedural finite-element software components using generic programming. A layer of generic software components consisting of C++ containers and algorithms is used for parallelization of the finite-element solver and for solver coupling in multi-physics applications. The advantages of generic programming in connection with finite-element codes are discussed and compared with those of object-oriented programming. The use of the proposed generic programming techniques is demonstrated in a tutorial fashion through basic illustrative examples as well as code excerpts from a large-scale finite-element program for serial and parallel computing platforms.

How relative absolute can be: SUMI and the impact of the nature of the task in measuring perceived software usability

This paper addresses the possibility of measuring perceived usability in an absolute way. It studies the impact of the nature of the tasks performed in perceived software usability evaluation, using for this purpose the subjective evaluation of an application’s performance via the Software Usability Measurement Inventory (SUMI). The paper reports on the post-hoc analysis of data from a productivity study for testing the effect of changes in the graphical user interface (GUI) of a market leading drafting application. Even though one would expect similar evaluations of an application’s usability for same releases, the analysis reveals that the output of this subjective appreciation is context sensitive and therefore mediated by the research design. Our study unmasked a significant interaction between the nature of the tasks used for the usability evaluation and how users evaluate the performance of this application. This interaction challenges the concept of absolute benchmarking in subjective usability evaluation, as some software evaluation methods aspire to provide, since subjective measurement of software quality will be affected most likely by the nature of the testing materials used for the evaluation.

---

3-Hierarchical resource management model on web grid service architecture

In this paper, we developed a framework for efficient resource management within the grid service environment. For considering the grid service architecture and functions, the resource management is the most important to grid service; therefore, GridRMF (Grid Resource Management Framework) is modeled and developed in order to respond to such variable characteristics of resources as accordingly as possible. GridRMF uses the participation level of grid resource as a basis of its hierarchical management. This hierarchical management divides managing domains into two parts: VMS (Virtual Organization Management System) for virtual organization management and RMS (Resource Management System) for metadata management. VMS mediates resources according to optimal virtual organization selection mechanism, and responds to malfunctions of the virtual organization by LRM (Local Resource Manager) automatic recovery mechanism. RMS, on the other hand, responds to load balance and fault by applying resource status monitoring information into adaptive performance-based task allocation algorithm.

Enhancing grid security by fine-grained behavioral control and negotiation-based authorization

Nowadays, Grid has become a leading technology in distributed computing. Grid poses a seamless sharing of heterogeneous computational resources belonging to different domains and conducts efficient collaborations between Grid users. The core Grid functionality defines computational services which allocate computational resources and execute applications submitted by Grid users. The vast models of collaborations and openness of Grid system require a secure, scalable, flexible and expressive authorization model to protect these computational services and Grid resources. Most of the existing authorization models for Grid have granularity to manage access to service invocations while behavioral monitoring of applications executed by these services remains a responsibility of a resource provider. The resource provider executes an application under a local account, and acknowledges all permissions granted to this account to the application. Such approach poses serious security threats to breach system functionality since applications submitted by users could be malicious. We propose a flexible and expressive policy-driven credential-based authorization system to protect Grid computational services against a malicious behavior of applications submitted for the execution. We split an authorization process into two levels: a coarse-grained level that manages access to a computational service; and a fine-grained level that monitors the behavior of applications executed by the computational service. Our framework guarantees that users authorized on a coarse-grained level behave as expected on the fine-grained level. Credentials obtained on the coarse-grained level reflect on fine-grained access decisions. The framework defines trust negotiations on coarse-grained level to overcome scalability problem, and preserves privacy of credentials and security policies of, both, Grid users and providers. Our authorization system was implemented to control access to the Globus Computational GRAM service. A comprehensive performance evaluation shows the practical scope of the proposed system.

Legal safeguards for privacy and data protection in ambient intelligence

To get the maximum benefit from ambient intelligence (AmI), we need to anticipate and react to possible drawbacks and threats emerging from the new technologies in order to devise appropriate safeguards. The SWAMI project took a precautionary approach in its exploration of the privacy risks in AmI and sought ways to reduce them. It constructed four “dark scenarios” showing possible negative implications of AmI, notably for privacy protection. Legal analysis of the depicted futures showed the shortcomings of the current legal framework in being able to provide adequate privacy protection in the AmI environment. In this paper, the authors, building upon their involvement in SWAMI research as well as the further advancement of EU privacy analysis, identify various outstanding issues regarding the legal framework that still need to be resolved in order to deal with AmI in an equitable and efficacious way. This article points out some of the lacunae in the legal framework and postulates several privacy-specific safeguards aimed at overcoming them.

---

A web services framework for distributed model management

Distributed model management aims to support the wide-spread sharing and usage of decision support models. Web services is a promising technology for supporting distributed model management activities such as model creation and delivery, model composition, model execution and model maintenance to fulfill dynamic decision-support and problem solving requests. We propose a web services based framework for model management (called MM-WS) to support various activities of the model management life cycle. The framework is based on the recently proposed Integrated Service Planning and Execution (ISP & E) approach for web services integration. We discuss encoding of domain knowledge (as individual models) and utilize the MM-WS framework to interleave synthesis of composite models with their execution. A prototypical implementation with an example is used to illustrate the utility of the framework to enable distributed model management and knowledge integration. Benefits and issues of using the framework to support model-based decision-making in organizational contexts are outlined.

Supercomputing applications to the numerical modeling of industrial and applied mathematics problems

Present and future supercomputers offer many opportunities and advantages to attack complex and demanding industrial and applied mathematical problems, but provide also new challenges. In the Peta-Flops regime, these concern both, the way to exploit the increasingly available power and the need of designing algorithms which are scalable and fault-tolerant at the same time. An example of a probabilistic domain decomposition method, which is indeed scalable and naturally fault-tolerant, is presented. Grid computing should also be mentioned as an increasingly popular way to perform massively distributed computing: it represents a way to exploit computing power, aside the existing supercomputers. Beyond classical supercomputers there is the prospective quantum computer, in view of which it is advisable to start now a search for suitable algorithms for certain classes of problems.