Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,912
tool for message-passing systems
, 1996
"... Programming for a parallel computer sysrem is a complex task. Unlike sequential programming, in the case of parallel programming, one is faced with the issues of parallelism detection, data dependence+ inter-processor communication, load distribution, among many others. This situation necessitates t ..."
Abstract
- Add to MetaCart
the use of sophisticated development and optimisation tools. Today, parallelising compilers which restructure a sequential program to a parallel version appropriate to a target architecture are available, especially for shared memory systems. On the other hand, parallelisation for message-passing systems
Snap-Stabilization in Message-Passing Systems
, 2009
"... We consider snap-stabilization in message-passing systems. Snap-stabilization permits to design protocols that withstand transient faults: Any computation that is started after faults cease immediately satisfies the expected specification. Our contribution is twofold, as we demonstrate that in messa ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
We consider snap-stabilization in message-passing systems. Snap-stabilization permits to design protocols that withstand transient faults: Any computation that is started after faults cease immediately satisfies the expected specification. Our contribution is twofold, as we demonstrate
Design Principles for Message-Passing Systems
"... At present, message passing is the most popular programming paradigm for asynchronous parallelism. Many "general-purpose" message-passing systems already exist, and many more are being developed. This paper argues that most existing systems are too unstructured to support large-scale ap ..."
Abstract
- Add to MetaCart
At present, message passing is the most popular programming paradigm for asynchronous parallelism. Many "general-purpose" message-passing systems already exist, and many more are being developed. This paper argues that most existing systems are too unstructured to support large
Snap-Stabilization in Message-Passing Systems?
"... In this paper, we tackle the problem of snap-stabilization in message-passing sys-tems. Snap-stabilization allows to design protocols that withstand transient faults: indeed, any computation that is started after faults cease immediately satisfies the expected specification. Our contribution is twof ..."
Abstract
- Add to MetaCart
In this paper, we tackle the problem of snap-stabilization in message-passing sys-tems. Snap-stabilization allows to design protocols that withstand transient faults: indeed, any computation that is started after faults cease immediately satisfies the expected specification. Our contribution
Hypertool: A Programming Aid for Message-Passing Systems
- IEEE TRANS. ON PARALLEL AND DISTRIBUTED SYSTEMS
, 1990
"... As both the number of processors and the complexity of problems to be solved increase, programming multiprocessing systems becomes more difficult and error-prone. This paper discusses programming assistance and automation concepts and their application to a program development tool for message-pass ..."
Abstract
-
Cited by 194 (17 self)
- Add to MetaCart
As both the number of processors and the complexity of problems to be solved increase, programming multiprocessing systems becomes more difficult and error-prone. This paper discusses programming assistance and automation concepts and their application to a program development tool for message-passing
Visual Programming for Message-Passing Systems
- International Journal of Software Engineering and Knowledge Engineering
, 1999
"... The attractiveness of visual programming stems in large part from the direct programmers interact with program elements as if they were real objects, since people deal better with the concrete objects than with the abstract. This paper describes a new graph based software visualization tool for ..."
Abstract
-
Cited by 5 (4 self)
- Add to MetaCart
for parallel message-passing programming named Visper that combines the levels of abstraction at which message-passing parallel programs are expressed and makes use of compositional programming.
Snap-Stabilization in Message-Passing Systems Brief Announcement
"... 1123) where we address the open problem of snap-stabilization in message-passing systems. The concept of snap-stabilization [3] offers an attractive approach to transient fault tolerance. As soon as such fault ends a snap-stabilizing protocol immediately operates correctly. Of course, ..."
Abstract
- Add to MetaCart
1123) where we address the open problem of snap-stabilization in message-passing systems. The concept of snap-stabilization [3] offers an attractive approach to transient fault tolerance. As soon as such fault ends a snap-stabilizing protocol immediately operates correctly. Of course,
Sharing Memory Robustly in Message-Passing Systems
, 1990
"... Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, single-writer multi-reader register in unreliable, asynchronous networks. The two message-passing models considered are a com ..."
Abstract
-
Cited by 144 (8 self)
- Add to MetaCart
-reader registers can be automatically emulated in message-passing systems. The overhead introduced by these emulations is polynomial in the number of processors in the systems. Immediate new results are obtained by applying the emulators to known shared-memory algorithms. These include, among others, protocols
Timestamps in Message-Passing Systems That Preserve the Partial Ordering,”
- Proc. 11th Austral. Comput. Sci. Conf. (ACSC ‘88)
, 1988
"... ABSTRACT Timestamping is a common method of totally ordering events in concurrent programs. However, for applications requiring access to the global state, a total ordering is inappropriate. This paper presents algorithms for timestamping events in both synchronous and asynchronous n1essage-passing ..."
Abstract
-
Cited by 223 (3 self)
- Add to MetaCart
ABSTRACT Timestamping is a common method of totally ordering events in concurrent programs. However, for applications requiring access to the global state, a total ordering is inappropriate. This paper presents algorithms for timestamping events in both synchronous and asynchronous n1essage-passing
Results 1 - 10
of
3,912
