Results 1 - 10 of 2,370

ADEPT flex - Supporting Dynamic Changes of Workflows Without Loosing Control

by Manfred Reichert, Peter Dadam - Journal of Intelligent Information Systems , 1998
"... . Today's workflow management systems (WFMSs) are only applicable in a secure and safe manner if the business process (BP) to be supported is well-structured and there is no need for ad hoc deviations at runtime. As only few BPs are static in this sense, this significantly limits the applicabil ..."
Abstract - Cited by 425 (112 self) - Add to MetaCart
. Today's workflow management systems (WFMSs) are only applicable in a secure and safe manner if the business process (BP) to be supported is well-structured and there is no need for ad hoc deviations at runtime. As only few BPs are static in this sense, this significantly limits

Effective runtime monitoring of distributed

by unknown authors
"... devices in the Internet of Things (IoT) and other data sources are increasingly bridging the gap between the physical and digital world by providing fine-grained data about real-world events. Enterprise software systems are adopting the paradigm of event-based systems (EBS) to enable them to react t ..."
Abstract - Add to MetaCart
the required type of information while trading off precision for costs. We previously introduced application-specific integrated aggregation (ASIA) as a means for collecting metadata in distributed event-based systems. In this paper, we show how ASIA can support IT Service Management in monitoring

Evaluating MapReduce for multi-core and multiprocessor systems

by Colby Ranger, Ramanan Raghuraman, Arun Penmetsa, Gary Bradski, Christos Kozyrakis - In HPCA ’07: Proceedings of the 13th International Symposium on High-Performance Computer Architecture , 2007
"... This paper evaluates the suitability of the MapReduce model for multi-core and multi-processor systems. MapReduce was created by Google for application development on data-centers with thousands of servers. It allows programmers to write functional-style code that is automatically parallelized and s ..."
Abstract - Cited by 256 (3 self) - Add to MetaCart
and scheduled in a distributed system. We describe Phoenix, an implementation of MapReduce for shared-memory systems that includes a programming API and an efficient runtime system. The Phoenix runtime automatically manages thread creation, dynamic task scheduling, data partitioning, and fault tolerance across

Information Consensus in Multivehicle Cooperative Control

by Wei Ren, et al. , 2007
"... The abundance of embedded computational resources in autonomous vehicles enables enhanced operational effectiveness through cooperative teamwork in civilian and military applications. Compared to autonomous vehicles that perform solo missions, greater efficiency and operational capability can be rea ..."
Abstract - Cited by 240 (24 self) - Add to MetaCart
be realized from teams of autonomous vehi-cles operating in a coordinated fashion. Potential applica-tions for multivehicle systems include space-based interferometers, combat, surveillance, and reconnaissance systems, hazardous material handling, and distributed reconfigurable sensor networks. To enable

Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory

by Daniel J. Scales, Kourosh Gharachorloo, Chandramohan A. Thekkath
"... This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compared to most other software distributed shared memory systems is that shared data can be kept coherent at a fine granulari ..."
Abstract - Cited by 236 (5 self) - Add to MetaCart
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compared to most other software distributed shared memory systems is that shared data can be kept coherent at a fine

Frameworks for Cooperation in Distributed Problem Solving

by Reid G. Smith, Randall Davis - IEEE Transactions on Systems, Man, and Cybernetics , 1981
"... Abstract — Two forms of cooperation in distributed problem solving are considered: task-sharing and result-sharing. In the former, nodes assist each other by sharing the computational load for the execution of subtasks of the overall problem. In the latter, nodes assist each other by sharing partial ..."
Abstract - Cited by 213 (2 self) - Add to MetaCart
at different locations in the case of a distributed sensing system). Particular attention is given to control and to internode communication for the two forms of cooperation. For each, the basic methodology is presented and systems in which it has been used are described. The two forms are then compared

The Nexus approach to integrating multithreading and communication

by Ian Foster, Carl Kesselman, Steven Tuecke - Journal of Parallel and Distributed Computing , 1996
"... Lightweight threads have an important role to play in parallel systems: they can be used to exploit shared-memory parallelism, to mask communication and I/O latencies, to implement remote memory access, and to support task-parallel and irregular applications. In this paper, we address the question o ..."
Abstract - Cited by 225 (33 self) - Add to MetaCart
Lightweight threads have an important role to play in parallel systems: they can be used to exploit shared-memory parallelism, to mask communication and I/O latencies, to implement remote memory access, and to support task-parallel and irregular applications. In this paper, we address the question

Supporting Dynamic Data Structures on Distributed-Memory Machines

by Anne Rogers, Martin C. Carlisle, John H. Reppy, Laurie J. Hendren , 1995
"... this article, we describe an execution model for supporting programs that use pointer-based dynamic data structures. This model uses a simple mechanism for migrating a thread of control based on the layout of heap-allocated data and introduces parallelism using a technique based on futures and lazy ..."
Abstract - Cited by 166 (8 self) - Add to MetaCart
this article, we describe an execution model for supporting programs that use pointer-based dynamic data structures. This model uses a simple mechanism for migrating a thread of control based on the layout of heap-allocated data and introduces parallelism using a technique based on futures and lazy

A Control-Based Middleware Framework for Quality of Service Adaptations

by Baochun Li, Klara Nahrstedt , 1999
"... In heterogeneous environments with performance variations present, multiple applications compete and share a limited amount of system resources, and su#er from variations in resource availability. These complex applications are desired to adapt themselves and to adjust their resource demands dynamic ..."
Abstract - Cited by 192 (24 self) - Add to MetaCart
novel Middleware Control Framework to enhance the e#ectiveness of QoS adaptation decisions by dynamic control and reconfiguration of internal parameters and functionalities of a distributed multimedia application. Our objective is to satisfy both system-wide properties (such as fairness among

Modeling and Simulation of a Dynamic Task-Based Runtime System for Heterogeneous Multi-Core Architectures

by Luka Stanisic, Samuel Thibault, Arnaud Legrand, Brice Videau, Jean-françois Méhaut
"... Abstract. Multi-core architectures comprising several GPUs have be-come mainstream in the field of High-Performance Computing. However, obtaining the maximum performance of such heterogeneous machines is challenging as it requires to carefully ooad computations and manage data movements between the ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
the different processing units. The most promis-ing and successful approaches so far rely on task-based runtimes that abstract the machine and rely on opportunistic scheduling algorithms. As a consequence, the problem gets shifted to choosing the task gran-ularity, task graph structure, and optimizing
Results 1 - 10 of 2,370