Previous work in the research field of Smart Camera (SC) networks intensively focused on algorithms for obtaining vision graphs in distributed camera networks consisting of static camera nodes. Each edge of the vision...
详细信息
the proceedings contain 52 papers. the topics discussed include: improved bitonic sorting by wire elimination;parallel join processing on graphics processors for the resource description framework;modeling data distri...
ISBN:
(纸本)9783800732227
the proceedings contain 52 papers. the topics discussed include: improved bitonic sorting by wire elimination;parallel join processing on graphics processors for the resource description framework;modeling data distribution for two-phase flow problems by weighted graphs;distributed vision graph update in mobile vision networks;routing based on evolved agents;a block device driver for parallel and fault-tolerant storage;operating system processor scheduler design for future chip multiprocessor;evaluation and refinement of a tuning tool for grid applications;platform-independent modeling of explicitly parallel programs;and delivering guidance information in heterogeneous systems.
We propose a structure named Cohorts to solve the problem of the access control of multiple entries to a critical section. Our solution is formalized as forming quorums in a k-coterie. It is resilient to node failures...
详细信息
We propose a structure named Cohorts to solve the problem of the access control of multiple entries to a critical section. Our solution is formalized as forming quorums in a k-coterie. It is resilient to node failures and/or network partitioning, invokes constant expected message cost and has comparably high availability.
PeerCQ is a totally decentralized system that performs information monitoring tasks over a network of peers with heterogeneous capabilities. It uses Continual Queries (CQs) as its primitives to express information-mon...
详细信息
PeerCQ is a totally decentralized system that performs information monitoring tasks over a network of peers with heterogeneous capabilities. It uses Continual Queries (CQs) as its primitives to express information-monitoring requests. A primary objective of the PeerCQ system is to build a decentralized Internet scale distributed information-monitoring system, which is highly scalable, self-configurable and supports efficient and robust way of processing CQs. this paper describes the basic architecture of the PeerCQ system and focuses on the mechanisms used for service partitioning at the P2P protocol layer. A set of initial experiments is reported, demonstrating the sensitiveness of the PeerCQ approach to large scale P2P information monitoring and the effectiveness of the PeerCQ service-partitioning algorithms with respect to load balancing and system utilization.
Dynamic module replacement - the ability to hot swap a component's implementation at runtime - is fundamental to supporting evolutionary change in long-lived and highly-available systems. Most existing solutions r...
详细信息
Dynamic module replacement - the ability to hot swap a component's implementation at runtime - is fundamental to supporting evolutionary change in long-lived and highly-available systems. Most existing solutions require special-purpose middleware or depend on research languages with limited support for mainstream software development. We present a language-neutral technique for dynamic module replacement using Service Facilities (Serfs) - a pattern-based design strategy for decoupling runtime dependencies. We demonstrate the sufficiency of Serfs with respect to a litmus test of criteria for module replacement. Next, we extend the traditional scope of module replacement to encompass the domain of modules for distributed protocols. We conclude by applying the Serf strategy to illustrate dynamic replacement of mutual exclusion protocols in modules for distributed resource allocation.
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of the number of active nodes but depend...
详细信息
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of the number of active nodes but dependent on the rate and number of modifications. We present the basic hash history scheme and discuss mechanisms for trimming the history over time. We simulate the efficacy of hash histories on several large CVS traces. Our results highlight a useful property of the hash history: the ability to recognize when two different non-commutative operations produce the same output, thereby reducing false conflicts and increasing the rate of convergence. We call these events co-incidental equalities and demonstrate that their recognition can greatly reduce the time to global convergence.
In this paper, we introduce an object-oriented programming and execution model to support location-aware applications for distributed mobile systems. We simplify application development by abstracting from single devi...
详细信息
We present a generic fetch-and-φ-based local-spin mutual exclusion algorithm with O(1) time complexity under the RMR (remote-memory-reference) measure. this algorithm is "generic" in the sense that it can b...
详细信息
We present a generic fetch-and-φ-based local-spin mutual exclusion algorithm with O(1) time complexity under the RMR (remote-memory-reference) measure. this algorithm is "generic" in the sense that it can be implemented using any fetch-and-φ primitive of rank 2N, where N is the number of processes. the rank of a fetch-and-φ primitive expresses the extent to which processes may "order themselves" using that primitive. By using an arbitration tree, a Θ (logr N) algorithm can be constructed using any primitive of rank r, where 2 &le r < N. For primitives that meet a certain additional condition, we present a Θ(log N/log log N) algorithm, which is time-optimal for certain primitives of constant rank.
In computer-based control systems, embedded software is taking over what mechanical and dedicated electronic systems used to do, that is, to engage and control the physical world, interacting directly with sensors and...
详细信息
In computer-based control systems, embedded software is taking over what mechanical and dedicated electronic systems used to do, that is, to engage and control the physical world, interacting directly with sensors and actuators. therefore, software running on a digital processor is tightly-coupled with its surrounding physical environment. We propose an integrated approach based on Timed Petri-Nets for modeling and analysis of embedded real-time systems where real-time scheduling behavior of the controller software is explicitly represented at the model-level, together withthe physical environment that it interacts with. this enables the designer to have an integrated view of the entire system while analyzing the system and making design decisions. We also describe a syntax-directed, automated translation procedure from Timed Petri-Nets to Timed Automata, thus enabling the use of model checkers such as UPPAAL for analysis purposes. We consider the railroad crossing problem as an application example, and evaluate alternatives for controller implementation on either single-processor or distributed multi-processor platforms based on the integrated approach.
Resource management, and especially power management, is a key aspect for the success of modern battery supplied multimedia devices. this class of devices are usually based on SoCs with a wide range of heterogeneous s...
详细信息
暂无评论