Search

Many grid architectures have been developed since the first proto-grid systems in the early 70's, but there are not so many based on groups using an efficient node neighbor selection. This paper proposes a grid architecture based on groups. The architecture organizes logical connections between nodes from different groups of nodes allowing sharing resources, data or computing time between groups. Connections are used to find and share available resources from other groups and they are established based on node's available capacity. Suitable nodes have higher roles in the architecture and their function is to organize connections based on a node selection process. Nodes' logical connections topology changes depending on some dynamic parameters. The architecture is scalable and fault-tolerant. We describe the protocol, its management and real measurements. It could be used as an intergrid protocol. [ABSTRACT FROM AUTHOR]

This paper presents an edge detection method based on bilateral filtering taking into account both spatial closeness and intensity similarity of pixels in order to preserve important visual cues provided by edges and reduce the sharpness of transitions in intensity values as well. In addition, the edge detection method proposed in this paper is achieved on sampled images represented on a newly developed virtual hexagonal structure. Due to the compact and circular nature of the hexagonal lattice, a better quality edge map is obtained. We also present a parallel implementation for edge detection on the virtual hexagonal structure that significantly increases the computation speed. [ABSTRACT FROM AUTHOR]

Geoscience analysis is currently limited by cumbersome access and manipulation of large datasets from remote sources. Due to their data-heavy and compute-light nature, these analysis workloads represent a class of applications unsuited to a computational grid optimized for compute-intensive applications. We present the Script Workflow Analysis for MultiProcessing (SWAMP) system, which relocates data-intensive workflows from scientists' workstations to the hosting datacenters in order to reduce data transfer and exploit locality. Our colocation of computation and data leverages the typically reductive characteristics of these workflows, allowing SWAMP to complete workflows in a fraction of the time and with much less data transfer. We describe SWAMP's implementation and interface, which is designed to leverage scientists' existing script-based workflows. Tests with a production geoscience workflow show drastic improvements not only in overall execution time, but in computation time as well. SWAMP's workflow analysis capability allows it to detect dependencies, optimize I/O, and dynamically parallelize execution. Benchmarks quantify the drastic reduction in transfer time, computation time, and end-to-end execution time. [ABSTRACT FROM AUTHOR]

With the actual applications of the wireless sensor networks growing, the challenges of the actual deployment get more and more. To improve deployment efficiency, reduce the deployment cost and evaluate the deployment risk, a planning and deployment platform for wireless sensor networks has been built. In this paper, the workflow of the planning and deployment platform for wireless sensor networks and its implementation framework are emphasized. The implementation framework, which is based on J-Sim simulator, provides the implementation details of the platform. An integrated workflow for the platform is illuminated to comprehend the framework clearly. [ABSTRACT FROM AUTHOR]

The image of a license plate is scanned by the camera attached to a mobile PDA device and the numbers on the plate are detected by the image processing parts in the proposed Mobile system. Then the numbers and the location of a mobile PDA device are encoded and transmitted along with the location information to a remote server through a wireless communication network. Finally, the server decodes the transmitted data as a text format and transmits it to the destination user. Consequently, this paper contributes a case study on the embedded system for designing of intelligent interface between a moving vehicle and a mobile PDA device, using a spatial relative distance scheme. The experimental results show that detection and tracking of a location of moving vehicle can be conducted efficiently with a mobile PDA device in real-time through wireless communication system and Internet. [ABSTRACT FROM AUTHOR]

This paper proposes a bio-inspired approach for the construction of a Grid information system in which metadata documents that describe Grid resources are disseminated and logically reorganized on the Grid. A number of ant-like agents travel the Grid through P2P interconnections and use probability functions to replicate resource descriptors and collect those related to resources with similar characteristics in nearby Grid hosts. Resource reorganization results from the collective activity of a large number of agents, which perform simple operations at the local level, but together engender an advanced form of "swarm intelligence" at the global level. An adaptive tuning mechanism based on the epidemic paradigm is used to regulate the dissemination of resources according to users' needs. Simulation analysis shows that the epidemic mechanism can be used to balance the two main functionalities of the proposed approach: entropy reduction and resource replication. [ABSTRACT FROM AUTHOR]

Credibility of knowledge grid members who act as a cooperative decision making community, affects the degree of accuracy of the decisions made. Apparently, decisions made by a decision maker should be affected by the degree of the decision maker's credibility. The problem is how to estimate decision makers' credibility within a knowledge grid environment, specially, those environments in which the number of decision makers is altered dynamically. In this article, a new approach to estimate the credibility of decision makers based upon the opinion of the other members of decision makers' community within a dynamic knowledge grid environment is proposed. [ABSTRACT FROM AUTHOR]

The computing grid no longer encompasses only traditional computers to perform coordinated tasks, as also low-end devices are now considered active members of the envisioned pervasive grid. Wireless sensor networks play an important role in this vision, since they provide the means for gathering vast amounts of data from physical phenomena. However, the current integration of wireless sensor networks and the grid is still primitive; one important aspect in this integration is providing higher-level abstractions for the development of applications, since accessing the data from wireless sensor networks currently implies dealing with very low-level constructs. We propose TinySOA, a service-oriented architecture that allows programmers to access wireless sensor networks from their applications by using a simple service-oriented API via the language of their choice. We show an implementation of TinySOA and some sample applications developed with it that exemplify how easy grid applications can integrate sensor networks. [ABSTRACT FROM AUTHOR]

Grid computing and pervasive computing have rapidly emerged and affirmed respectively as the paradigm for high performance computing and the paradigm for user-friendly computing. The conjunction of such paradigms are now generating a new one, the Pervasive Grid Computing, which aims at extending classic grids with characteristics of pervasive computing like spontaneous and transparent integration of mobile devices, context-awareness, pro-activity, and so on. In this paper, we present mechanisms and a software infrastructure for executing tasks in a pervasive grid. In particular, the proposed solution, which provides an implementation of the Utility Computing model, enables users to submit tasks and to pick up results without concerning on requiring and handling hardware resources. [ABSTRACT FROM AUTHOR]

Service-Oriented Architecture (SOA) development paradigm has emerged to improve the critical issues of creating, modifying and extending solutions for business processes integration incorporating process automation and automated exchange of information between organizations. Web services technology follows the SOA's principles for developing and deploying applications. Besides, Web services are considered as the platform for SOA, for both intra- and inter-enterprise communication. However, an SOA does not incorporate information about occurring events into business processes that are the main features of supply chain management. These events and information delivery are addressed in an Event-Driven Architecture (EDA). Having this into account, we propose a Web service-based system named BPIMS-WS that offers a brokering service for the procurement of products in supply chain management scenarios. As salient contributions, our system provides a hybrid architecture combining features both SOA and EDA and a set of mechanisms for business processes pattern management, monitoring based on UML sequence diagrams, Web services-based management, event publish/subscription and reliable messaging service. [ABSTRACT FROM AUTHOR]

Recent growth in computing devices from the smartphone to the desktop computer has led to users interacting with multiple computing devices throughout the course of the day. Modern computing sessions are a graphically rich, multi-tasking experience, representing a considerable amount of state. There is seldom the ability to automatically move a session from one device to another; instead users must manually restore applications to their previous state. Without session mobility, the problems of unsynchronised information and communication barriers become apparent. We present a thin client approach to supporting session mobility across a broad range of devices. We use an adaptive approach, thereby supporting a fine granularity of devices. Furthermore, our approach enables rich diverse sessions composed of applications specific to a range of platforms, reducing constraints imposed by mobile devices, and boosting productivity by allowing access to a wider range of applications from a single device. [ABSTRACT FROM AUTHOR]

Recently, the Desktop-Grid ADaptive Application in Java (DG-ADAJ) project has been unveiled. Its goal is to provide an environment which facilitates adaptive control of distributed applications written in Java for the Grid or the Desktop Grid. However, in its current state it can be used only in closed environments (e.g. within a single laboratory), as it lacks features that would make it ready for an "open Grid." The aim of this paper is to show how the DG-ADAJ can be augmented by usage of software agents and ontologies to make it more robust. [ABSTRACT FROM AUTHOR]

This paper presents a framework of simulation environment (SEMU) which allows developers to understand the behavior of applications or protocols for a wireless sensor network (WSN) before deploying real nodes in a physical environment. For eliminating the gap between simulation and real deployment, SEMU has supported fast real code emulation by dynamic binary translation technique. SEMU also models the controlled environment as virtual operating system (Virtual OS) to coordinate the interactions of large number of nodes. In addition, we have proposed a co-simulation model to enhance the accuracy of pure software simulation. Then a further synchronization problem will be addressed and resolved by the co-simulation model. The evaluation results show SEMU is really a fast scalable WSN simulator with real code emulation. [ABSTRACT FROM AUTHOR]

The concept of Object-based Storage Devices (OSD), which is standardized by the ANSI T10 technical committee, is an emerging storage paradigm that replaces storages of traditional fixed-size block abstraction with those of variable-size objects that virtualizes the underlying physical storage. In this paper, we describe our substantial implementation of the OSD security framework in OASIS, which is an OSD system developed at ETRI (Electronics and Telecommunications Research Institute) in Korea. We also describe our credential caching subsystem, called Lcache, which is implemented in the client side of our OSD security framework in order to improve the performance of issuing credentials. [ABSTRACT FROM AUTHOR]

In recent large scale deployment of active RFID systems has been introduced by many applications, but a variety of critical issues remain unresolved. Especially, the impact of collision is the most essential problem. In this paper, we propose a Learning-based Dynamic Framed Slotted ALOHA algorithm (LDFSA) which mitigates collision from the active RFID tags and complies with international standard, ISO/IEC 18000-7. In addition, this paper includes the performance evaluations of the proposed LDFSA algorithm with the conventional algorithms. According to the result, the proposed LDFSA algorithm shows better performance than other conventional algorithms. [ABSTRACT FROM AUTHOR]

With the increasingly complexity of ubiquitous computing environment, large and distributed embedded software are used more and more widely. After a design model has been completed, assigning components in the design model while meeting multiple runtime constraints is a critical problem in model-based large distributed embedded software development. In this paper, we propose a new method of component assignment. This method uses backtracking algorithm to search the assignment space, and a balance distance function to decide the feasible assignment scheme. Unlike other methods that view computation, communication, and memory resources as independent resources, this method analyzes their holistic influence on component assignment with the goal of keeping the balance between computation resource consumption and memory resource consumption, and the balance of execution density among different processors. Experimental evaluation shows the component assignment method has high success ratios, low time overheads, and good scalability. [ABSTRACT FROM AUTHOR]

In this paper we describe the execution model supported by suma/g, a middleware built on top of Globus for execution of Java applications on the grid. This execution model allows a user to launch Java applications that will run on a grid from her machine without requiring this machine to be part of the grid (e.g. a gLite User Interface). Additionally, it allows grid users to regard local file systems, i.e. file systems accessible from their local workstations, as part of the set of file systems accessible within the grid. This eliminates the necessity of performing previous uploads of classes and data files, which helps to meet the grid goal of achieving seamless access to distributed resources. We describe how to implement the services offered by this execution model on Globus-based grids. We compare the use of this execution model with the standard mechanisms for submission of Java jobs in lcg/gLite, a flavor of Globus Toolkit 2. We present experiments showing that this execution model can improve performance for running Java applications on Globus-based grids. [ABSTRACT FROM AUTHOR]

With the development of theory and technology of Web Service, Web Service Composition (WSC) has become the core Service-Oriented Computing technology. It is important for business process to select the best component services with multi-dimensional QoS assurances to construct a complex one. But there exist some problems, such as evaluation for QoS properties of a service is not full-scale and the criteria is not clear, the weight for each QoS metric doesn't consider both subjective sensations and objective facts. In this paper we propose a WSC model to provide multi-dimensional QoS supports in service selection and replacement. We consider SLA and recovery mechanism for the service failure during its execution. A utility function is defined as the evaluation standard, which aggregates all QoS metrics after normalizing their values. Then we use Subjective-Objective Weight Mode (SOWM) to set the weight of each QoS metric. Finally we introduce our prototype and evaluations, test the availability of the decision mode and the results prove it is predominant compared with other decision modes. [ABSTRACT FROM AUTHOR]

With the rapid development of technologies related to Ubiquitous Sensor Network (USN), sensors are being utilized in various application areas. In general, a sensor has a low computing capacity and power and keeps sending data to the central server. In this environment, uncertain data can be stored in the central server due to delayed transmission or other reasons and make query processing produce wrong results. Thus, this paper examines how to process uncertain data in ubiquitous sensor networks and suggests an efficient index, called UR-tree, for uncertain data. The index reduces the cost of update by delaying update in uncertainty areas. In addition, it solves the problem of low accuracy in search resulting from update delay by delaying update only for specific update areas. Lastly, we analyze the performance of UR-tree and prove the superiority of its performance by comparing its performance with that of R-Tree and PTI using various datasets. [ABSTRACT FROM AUTHOR]

One of the challenges of Grid computing is the integration of legacy scientific applications. The Web Services Architecture (WSA) is an ideal technology to integrate legacy applications into the grid environment. Web Services Resource Framework (WSRF) extends Web Services and makes them stateful. Based on WSRF, we implement a framework which utilizes WSRF resource to submit applications and to monitor execution status. We deploy only one Factory Service to create the resources and one Grid Service as the uniform interface for all the applications in each computing resource. We can dynamically deploy some legacy applications in the Grid or remove these applications without stopping the execution of entire system. Moreover, we present an implementation of one meta-scheduler which integrates Grid resources in complex Grid environment. [ABSTRACT FROM AUTHOR]

This article presents a dynamic data distribution method for data storage in a P2P network. In our system named Us (Ubiquitous storage), peers are arranged in groups called Metapeers to deal with account failure correlation. To minimize end user traffic according to the reconstruction process, distribution must take into account a new measure: the maximum disturbance cost of a peer. In a previous work, we defined a static distribution scheme which minimizes this reconstruction cost derivated from affine plan theory. In this paper we extend this distribution scheme to deal with the dynamic behaviour of peer to peer systems. [ABSTRACT FROM AUTHOR]

Today large-scale applications require access to data stored in heterogeneous storage systems located at geographically distributed virtual organizations. In such applications, users are forced to deal with different administrative policies and structures at each site, and various data access mechanisms on each storage system. This implies a lot of human interventions in order to develop dedicated programs and scripts for data transfer between theses systems. This paper presents GRid-enAbled Virtual file sYstem (GRAVY) architecture which enables the automation of data transfers between distributed file systems irrespective of their heterogeneity. This feature enables high-level schedulers integrated with GRAVY to control data placements like computational jobs. GRAVY supports multiple data access protocols and provides an easy-to-use interface for novice Grid users. [ABSTRACT FROM AUTHOR]

It is desirable to replace supercomputers with low cost networks of computers to run computationally intensive programs. To alleviate the burden of writing distributed programs, automatic translation of sequential to distributed programs is highly recommended. In this paper a new architecture to support automatic translation of sequential to distributed programs is offered. A formal specification of the structure and behavior of the architecture components is presented. The applicability of the specified architecture is demonstrated by presenting its implementation details and evaluating the performance of the resultant distributed program. [ABSTRACT FROM AUTHOR]

In many distributed applications, each participating node can be characterized by one single set of attributes. The problem is to support complex queries, such as range and k-nearest-neighbor (KNN) queries, on this set of multidimensional attributes. Traditional peer-to-peer (P2P) systems either adopt an unstructured interconnection and use flooding to search for matching nodes, or implement a distributed hash table (DHT) to serve as a directory for indexing the attributes. The former suffers from excessive flooding traffic, while the latter has the overhead of updating and maintaining the directory. This paper introduces an attribute-based P2P interconnection strategy that uses the attributes to interconnect the peers instead of hash keys. Under the condition that each node is characterized by one set of attributes, the attribute-based networks can support range and KNN queries, guarantee lookup efficiency, and eliminate the need to maintain a directory. [ABSTRACT FROM AUTHOR]

In this paper, we have addressed the complex problem of determining a recovery line for cluster federation and have proposed a fast recovery algorithm to handle failures in cluster federations. The main feature of the proposed algorithm is that it can be executed simultaneously by all clusters in the cluster federation. Besides, the number of trips to the stable storage necessary for executing the algorithm is much less compared to the same in some existing works. Also the proposed algorithm does not suffer from any message storm unlike some noted work in this area. [ABSTRACT FROM AUTHOR]

Resource sharing computing is a project that realizes high performance computing by utilizing the resources of peers that are connected to the Internet. Resource sharing computing provides a dynamic internet environment where peers can freely participate, but it raises questions on the reliability of operation processing. Existing resource sharing computing stores intermediate operation results in peers' local disks. Thus, when faults happen on peers' side, some peers need to wait for processing to reconnect with possibility of considerable delay. In case there is no reconnection, the intermediate operation results cannot be used. In addition, it is difficult to support cooperation due to incompatible modes of operation processing among heterogeneous systems. This thesis is to propose a cooperation management system, and define cooperation and cooperation groups necessary to improve the reliability in the resource sharing computing environment. Cooperation is a series of tasks that involve sorting tasks, processing tasks sequentially, and producing results. Cooperation group is a gathering of peers that can cooperate. Groups are created among different types of systems to enable cooperation among peers within the same group. Also, middle DB Server is proposed in a hierarchical structure to shorten delay and increase the reusability of intermediate operation results. As the intermediate operation results are stored in the middle DB Server in case there occurs a fault on peers' side, waiting time for reconnection is reduced through cooperation, and the reusability of intermediate operation result is improved. In this paper, we propose a structure that can store intermediate operation result in middle DB Server to improve reliability in resource sharing computing environment, and suggest a design for cooperation group service, discovery service, and task management service of cooperation management system. [ABSTRACT FROM AUTHOR]

We present an index system for locating files or other data objects in a grid environment. The system is constructed using a distributed hash table, and is scalable, fault-tolerant, and self-organizing. The index is dynamically updated to reflect the state of the storage elements, and can hence deal with nomadic data. The system provides extra services to ease integration with other systems: A registrant service integrates existing storage elements into the system, and a query proxy provides an easy way to query the system. A security model, which builds on the existing grid security model is also provided. An implementation has been created and its performance measured. The system is shown to scale as more nodes are added to the system. [ABSTRACT FROM AUTHOR]

Grid systems are well-known for its high performance computing or large data storage with inexpensive devices. They can be categorized into two major types: computational grid and data grid. Data grid is used for data intensive applications. In data grids, replication is used to reduce access latency. It can also improve data availability, load balancing and fault tolerance. If there are many replicas, they may have coherence problems while being updated. In this paper, based on the aggressive-copy method, we developed an algorithm using pipeline concept, such that the data transfer tasks can be done simultaneously. This novel Pipeline-based Aggressive Copy method can accelerate the update speed and decrease users' waiting times. We used Globus toolkit for our framework. Compared with the existing schemes and from the preliminary simulation results, our method shows notable improvement in overall completion time. [ABSTRACT FROM AUTHOR]

This paper presents a new Service Discovery Protocol (SDP) suitable for Wireless Sensor Networks (WSN). The restrictions that are imposed by ultra low-cost sensor and actuators devices (basic components of a WSN) are taken into account to reach a minimal footprint solution. The WSN communication model we use is based on the picoObject approach [1] which implements a lightweight middleware for WSN on top of standard object oriented middlewares using a small set of interfaces. The proposed SDP uses also this set, so it supposes the minimal overhead for devices and communication protocols, allowing, at the same time, the deployment of a valuable set of services. [ABSTRACT FROM AUTHOR]

In a pervasive multimodal multimedia computing system, the user can continue working on a computing task anytime and anywhere using forms of modality that suit his context. Similarly, the media supporting the chosen modality are selected based on their availability and user's context. In this paper, we present the infrastructure supporting the migration of a visually-impaired user's task in a pervasive multimodal multimedia computing environment. Using user's preferences which quantify user's satisfaction, we derive the user's task feasible configuration. The heart of this work is the machine learning-derived training to acquire knowledge leading to configuration optimization. Data validation is presented through scenario simulations and design specification. This work is our continuing contribution to advance research on making informatics more accessible to handicapped users. [ABSTRACT FROM AUTHOR]

Clustering allows hierarchical structures to be built on the nodes and enables more efficient use of scarce resources, such as frequency spectrum, bandwidth, and energy in wireless sensor networks (WSNs). This paper proposes an energy efficient clustering algorithm for self-organizing and self-managing high-density large-scale WSNs, called SNOW cluster. It introduces region node selection as well as cluster head election based on the residual battery capacity of nodes to reduce the costs of managing sensor nodes and of the communication among them. Each sensor node autonomously selects cluster heads based on a probability that depends on its residual energy level. The role of cluster heads or region nodes is rotated among nodes to achieve load balancing and extend the lifetime of every individual sensor node. To do this, SNOW cluster clusters periodically to select cluster heads that are richer in residual energy level, compared to the other nodes, according to clustering policies from administrators. To prove the performance improvement of SNOW cluster, the ns-2 simulator was used. The results show that it can reduce the energy and bandwidth consumption for clustering and managing WSNs. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel application on grid, the biometrics grid, to promote the development of both biometrics technology and grid computing. The biometrics grid aims to overcome/resolve some main problems of existing biometric technology using grid computing. The most important service provided by the biometrics grid is an algorithm testbed for biometrics researchers on single biometric or multimodal biometrics. We give a case of two respective biometrics recognition processes in voiceprint and face on grid to show that it is feasible in deploying different biometrics applications on a testbed for performance evaluation. [ABSTRACT FROM AUTHOR]

One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient algorithms have been studied for specific networks, general solutions like those available in well-known MPI distributions (e.g. the MPI_Alltoall operation) are strongly influenced by the congestion of network resources. In this paper we present an integrated approach to model the performance of the All-to-All collective operation, which consists in identifying a contention signature that characterizes a given network environment, using it to augment a contention-free communication model. This approach, assessed by experimental results, allows an accurate prediction of the performance of the All-to-All operation over different network architectures with a small overhead. [ABSTRACT FROM AUTHOR]

XtremWeb-CH (XWCH) is a software system that makes it easy for scientists and industrials to deploy and execute their parallel and distributed applications on a public-resource computing infrastructure. The objective of XWCH is to develop a real High Performance Peer-To-Peer platform with a distributed scheduling and communication system. The main idea is to build a completely symmetric model where nodes can be providers and consumers at the same time. This paper describes the different "components" of an XWCH infrastructure and the new features proposed by this platform compared to other similar Global Computing projects. It also describes the porting, the deployment and the execution of a phylogenetic CPU time consuming application on an experimental XWCH platform. [ABSTRACT FROM AUTHOR]

A framework for managing pervasive computing is presented. It enables end-users to easily and naturally build visual interfaces for monitoring and customizing context-aware services. It is built on an exiting a symbolic location model to represent the containment relationships between physical entities, computing devices, and places. It supports a compound document framework for visualizing and customizing the model. It provides physical entities, places, computing devices, and services in smart spaces with visual components to annotate and control them and to dynamically assemble visual components into a visual interface for managing the spaces. It can visualize and configure the spatial structure of physical entities and places and the status and attributes of computing devices and services, e.g., the location in which context-aware services are available. By using the framework, end-users can monitor and customize pervasive computing environments by viewing and editing documents. [ABSTRACT FROM AUTHOR]

Imbalanced workload-distribution can significantly degrade performance of grid computing environments. In the past, the theory of divisible load has been widely investigated in static heterogeneous systems. However, it has not been widely applied to grid environments, which are characterized by heterogeneous resources and dynamic environments. In this paper, we propose a performance-based approach to workload distribution for master-slave types of applications on grids. Furthermore, applications with irregular workloads are addressed. We implemented three kinds of applications and conducted experimentations on our grid test-beds. Experimental results show that this approach performs more efficiently than conventional schemes. Consequently, we claim that dynamic workload distribution can benefit applications on grid environments. [ABSTRACT FROM AUTHOR]

The peer-to-peer (P2P) systems have grown significantly over the last few years due to their high potential of sharing various resources. Analyzing the workload of P2P system, however, is very challenging as it involves with the cooperation of many peers. Researches have shown that P2P systems become very effective when dividing the peers into two layers, SP (Super-Peer) and OP (Ordinary-Peer). In this configuration, SP based P2P systems have to deal with a large volume of queries from OPs. Therefore, it is important for SPs to keep their workload stable to provide quality service to the OPs. In this study, we present a collaboration strategy for workload balancing based on SP's workload characteristics and status. Through the SP's load balancing mechanism, the message response time is decreased and the workload of P2P system becomes more stable. [ABSTRACT FROM AUTHOR]

The deployment of J2EE systems in Grid environments remains a difficult task: the architecture of these applications are complex and the target environment is heterogeneous, open and dynamic. In this paper, we show how the component-based approach simplifies the design, the deployment and the reconfiguration of a J2EE system. We propose an extended architecture description language that allows specifying the deployment of enterprise systems in enterprise Grids, driven by resources and location constraints. With respect to these constraints we present a deployment process that instantiates propagatively the application, taking into account resources and hosts availability. Finally, we present an autonomic solution for recovery from failures. [ABSTRACT FROM AUTHOR]

Pervasive Grids emerge as a new paradigm for providing nomadic users with ubiquitous access to digital information and computing resources. However, pervasive grids arise a number of crucial issues related to privacy and security, especially authentication and access control, which constitute the security front-end. In this paper, we propose a trust based model of authentication and access control that allows nomadic users to roam from site to site and to gain access to surrounding/remote resources wrt her status in her home site and to the local policy of the site where she is standing. This model is supported by a software architecture called Chameleon. The Chameleon permits users to access grid resources and to implement adhoc interactions with the local grid site. [ABSTRACT FROM AUTHOR]

Position-based routing has been proven to be a scalable and efficient solution for packet routing in mobile ad hoc networks (MANETs) by utilizing location information of mobile nodes. The location service provides geographic locations for all nodes and is therefore critical to position-based routing. In general, the control overhead in a position-based routing protocol is mainly dominated by location updates. In this paper, we propose a location service called Modified Grid Location Service (MGLS), which employs a binary grid partitioning scheme to reduce the control overhead associated with the location management and supports large scale ad hoc networks. We then use a theoretical model to analyze both MGLS and GLS. Both theoretical analysis and simulation results show that MGLS can reduce the location update overhead in location services. [ABSTRACT FROM AUTHOR]

Message races, which can cause nondeterministic executions of a parallel program, should be detected for debugging because nondeterminism makes debugging parallel programs a difficult task. Even though there are some tools to detect message races in MPI programs, they do not provide practical information to locate and debug message races in MPI programs. In this paper, we present an on-the-fly detection tool, which is MPIRace-Check, for debugging MPI programs written in C language. MPIRace-Check detects and reports all race conditions in all processes by checking the concurrency of the communication between processes. Also it reports the message races with some practical information such as the line number of a source code, the processes number, and the channel information which are involved in the races. By providing those information, it lets programmers distinguish of unintended races among the reported races, and lets the programmers know directly where the races occur in a huge source code. In the experiment we will show that MPIRace-Check detects the races using some testing programs as well as the tool is efficient. [ABSTRACT FROM AUTHOR]

It is important to debug unintended data races in OpenMP programs efficiently, because such programs are often complex and long-running. Previous tools for detecting the races does not provide any effective facility for understanding the complexity of threads involved in the reported races. This paper presents a thread visualization tool to present a partial order of threads executed in the traced programs with a scalable graph of abstract threads upon a three-dimensional cone. The scalable thread visualization is proved to be effective in debugging races using a set of synthetic programs. [ABSTRACT FROM AUTHOR]

During the past several years, the grid application executed same jobs on one or more hosts in parallel, but the recent grid application is requested to execute different jobs linearly. That is, the grid application takes the form of workflow application. In general, efficient scheduling of workflow applications is based on heuristic scheduling method. The heuristic considering relation between hosts would improve execution time in workflow applications. But because of the heterogeneity and dynamic nature of grid resources, it is hard to predict the performance of grid application. In addition, it is necessary to deal with user's QoS as like performance guarantee. In this paper, we propose a service model for predicting performance and an adaptive workflow scheduling strategy, which uses maximum flow algorithms for the relation of services and user's QoS. Experimental results show that the performance of our proposed scheduling strategy is better than common-used greedy strategies. [ABSTRACT FROM AUTHOR]

As grid infrastructures become more dynamic in order to cope with the uncertainty of demand, they are becoming extremely difficult to manage. At the Belfast e-Science Centre, we are attempting to address this issue by developing Self Managing Grid Middleware. This paper gives an overview of the middleware and focuses on the design, implementation and evaluation of a Resource Manager. Also in this paper we will see how our approach, which is based on federated UDDI registries, has enabled us to implement some of the desired features of next generation grid software. [ABSTRACT FROM AUTHOR]

Ad hoc network is an infra structure less network, which is formed by mobile devices like laptops, PDAs, cell phones etc. Each device has different computational capability, power, hardware and software, which forms a heterogeneous network. These devices can be integrated to form an infrastructure known as grid. A grid integrates and coordinates resources and users that are within the same network with different capabilities. Hence we can visualize a grid over an ad hoc network that effectively utilizes the heterogeneity in the mobile devices. The major challenge in forming a grid over an ad hoc network is the mobility of the nodes. In this paper, we address the challenges due to mobility by considering a trace model for the movement of the nodes. Next, we demonstrate the feasibility of forming a grid over a mobile ad hoc network by proposing lightweight algorithms for grid formation, resource discovery, negotiation, job scheduling, and resource sharing. We have analyzed the performance of mobile ad hoc grid both by using a theoretical model and by simulation. The results point to a promising approach to form a mobile ad hoc grid. [ABSTRACT FROM AUTHOR]