The scale, heterogeneity, and dynamism of emerging distributed and decentralized environments make coordination a significant and challenging problem. In this paper we present Comet, a scalable peer-to-peer content-ba...
详细信息
The scale, heterogeneity, and dynamism of emerging distributed and decentralized environments make coordination a significant and challenging problem. In this paper we present Comet, a scalable peer-to-peer content-based coordination space. Comet provides a global virtual shared-space that can be associatively accessed by all peer nodes in the system, and access is independent of the physical location of the tuples or identifiers of the host. Dynamically constructed, transient coordination spaces are also supported to enable context locality to be explicitly exploited for improving system performance. The design, implementation, and experimental evaluation of Comet using the PlanetLab platform are presented.
This article addresses the generation of traces to monitor the execution of distributed Java systems, and investigates the use of Aspect-Oriented Programming (AOP) as the instrumentation strategy to get the necessary ...
详细信息
Location tracking in a personal communications services (PCS) network requires location update and paging. These procedures incur a large signaling cost as the demand for these services increases. In a location update...
详细信息
Location tracking in a personal communications services (PCS) network requires location update and paging. These procedures incur a large signaling cost as the demand for these services increases. In a location update process, the mobile terminal (MT) registers with the system when it enters into a new location area (LA) that contains many cells. In a paging process, the network system initiates a search process to find the mobile terminal to deliver an incoming call. A heuristic location tracking strategy is proposed based on location probability models that aims to reduce the signaling cost involved in paging process under delay bounds. Numerical results demonstrate that this paging strategy performs better than other methods [W. Wang et al., (2001)] for both uniform and non-uniform location probability distributions.
This paper describes a comprehensive prototype of large-scale fault adaptive embedded software developed for the proposed Fermilab BTeV high energy physics experiment. Lightweight self-optimizing agents embedded withi...
详细信息
Reconfiguration and self-adaptation are vital capabilities of sensor networks and networked embedded systems that are required to operate in dynamic environments. This paper presents an approach for software reconfigu...
详细信息
Reconfiguration and self-adaptation are vital capabilities of sensor networks and networked embedded systems that are required to operate in dynamic environments. This paper presents an approach for software reconfiguration based on exploration of the design space of the application. The design space is represented by formally modeling all the software components, their alternative implementations and their interactions. Reconfiguration is triggered by monitoring the system and is performed by transitioning to a new configuration that satisfies the system constraints. The approach is demonstrated using experimental results for a representative tracking application.
In this paper we present the design of the rule-based framework for the runtime management of high-performance parallel scientific applications. The framework addresses the formulation of application management behavi...
详细信息
In this paper we present the design of the rule-based framework for the runtime management of high-performance parallel scientific applications. The framework addresses the formulation of application management behaviors as reaction rules, the injection of rules at runtime, their correct, efficient and scalable parallel enforcement, and the detection and resolution of rule conflicts. Unlike rule-based frameworks in business management and security and resource management domains, the presented framework focuses on high-performance parallel scientific applications, which require consistent and efficient management across processors and components. The framework is part of the Accord programming system (Liu et al., 2004)
Formal specification languages are often perceived as difficult to use by practitioners, and are therefore rarely-used in industrial software development practices. Numerous researchers have developed specification pa...
详细信息
Formal specification languages are often perceived as difficult to use by practitioners, and are therefore rarely-used in industrial software development practices. Numerous researchers have developed specification pattern systems to facilitate the construction of formal specifications of system properties. Feedback indicates that these patterns are considered helpful, but many practitioners prefer capturing properties using informal notations, such as natural language, instead of formal specification languages. This paper describes a project that addresses this technology gap. First, we introduce a stepwise process for deriving and instantiating system properties in terms of their natural language representations. The key components of this process are structured natural language grammars and specification pattern systems. Second, we describe SPIDER, a prototype implementation of a tool suite supporting this specification process. We illustrate the use of our approach with a description of a stepwise construction process of property specifications of a real-world automotive embedded system using Spider.
Reprogramming of sensor networks is an important and challenging problem as it is often necessary to reprogram the sensors in place. In this paper, we propose a multihop reprogramming service designed for Mica-2/XSM m...
详细信息
Reprogramming of sensor networks is an important and challenging problem as it is often necessary to reprogram the sensors in place. In this paper, we propose a multihop reprogramming service designed for Mica-2/XSM motes. One of the problems in reprogramming is the issue of message collision. To reduce the problem of collision and hidden terminal problem, we propose a sender selection algorithm that attempts to guarantee that in a neighborhood there is at most one source transmitting the program at a time. Further, our sender selection is greedy in that it tries to select the sender that is expected to have the most impact. We also use pipelining to enable fast data propagation. MNP is energy efficient because it reduces the active radio time of a sensor node by putting the node into "sleep" state when its neighbors are transmitting a segment that is not of interest. Finally, we argue that it is possible to tune our service according to the remaining battery level of a sensor, i.e., it can be tuned so that the probability that a sensor is given the responsibility of transmitting the code is proportional to its remaining battery life
Jobs submitted into a cluster have varying requirements depending on user-specific needs and expectations. Therefore, in utility-driven cluster computing, cluster resource management systems (RMSs) need to be aware of...
详细信息
Jobs submitted into a cluster have varying requirements depending on user-specific needs and expectations. Therefore, in utility-driven cluster computing, cluster resource management systems (RMSs) need to be aware of these requirements in order to allocate resources effectively. Service level agreements (SLAs) can be used to differentiate different value of jobs as they define service conditions that the cluster RMS agrees to provide for each different job. The SLA acts as a contract between a user and the cluster whereby the user is entitled to compensation whenever the cluster RMS fails to deliver the required service. In this paper, we present a proportional share allocation technique called LibraSLA that takes into account the utility of accepting new jobs into the cluster based on their SLA. We study how LibraSLA performs with respect to several SLA requirements that include: (i) deadline type whether the job can be delayed, (ii) deadline when the job needs to be finished, (iii) budget to be spent for finishing the job, and (iv) penalty rate for compensating the user for failure to meet the deadline
We present an algorithm for scheduling distributed data intensive bag-of-task applications on data grids that have costs associated with requesting, transferring and processing datasets. We evaluate the algorithm on a...
详细信息
ISBN:
(纸本)9780780390379
We present an algorithm for scheduling distributed data intensive bag-of-task applications on data grids that have costs associated with requesting, transferring and processing datasets. We evaluate the algorithm on a data grid testbed and present the results.
暂无评论