Searching for authors named "Philippas Tsigas" – sorted by Relevance.
28 documents found, showing 1 through 10.
Next 10 →
-
Fast, Reactive and Lock-free Multi-Word Compare-and-Swap Algorithms
- …Shared memory multiprocessors typically provide a set of single-word compare-and-swap-like hardware primitives to support synchronization. Although these are conceptually powerful enough to support higher-level synchronization, from the programmer's point of view they are not as useful as their gene…
- Add To MetaCart
-
Space Efficient Wait-Free Buffer Sharing in Multiprocessor Real-Time Systems Based on Timing Information
- …A space efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor systems is presented in this paper. The commonly used method to implement shared buffers in real-time systems is based on mutual exclusion. Mutual exclusion is penalised by blocking that typically lea…
- Cited by 7 (0 self) – Add To MetaCart
-
Integrating Non-blocking Synchronisation in Parallel Applications: Performance Advantages and Methodologies
- …In this paper we investigate how performance and speedup of applications would be aoeected by using non-blocking rather than blocking synchronisation. The results obtained show that for many applications, non-blocking synchronisation lead to significant speedups for a fairly large number of processo…
- Cited by 15 (2 self) – Add To MetaCart
-
An Extensible Educational Animation Environment for Distributed Algorithms
- …LYDIAN is an environment to support the teaching and learning of distributed algorithms. It provides a collection of distributed algorithms as well as continuous animations. Users can combine algorithms and animations with arbitrary network structures defining the interconnection and behaviour of th…
- Cited by 1 (1 self) – Add To MetaCart
-
Wait-free Consensus in "In-phase" Multiprocessor Systems
- …In the consensus problem in a system with n processes, each process starts with a private input value and has to choose irrevocably a decision value, which was the input value of some process of the system; moreover, all processes have to decide on the same value. This work deals with the problem of…
- Cited by 4 (2 self) – Add To MetaCart
-
Evaluating The Performance of Non-Blocking Synchronisation on Shared-Memory Multiprocessors
- …Parallel programs running on shared memory multiprocessors coordinate via shared data objects/structures. To ensure the consistency of the shared data structures, programs typically rely on some forms of software synchronisations. Unfortunately typical software synchronisation mechanisms usually res…
- Cited by 4 (2 self) – Add To MetaCart
-
Growing Squares: Animated Visualization of Causal Relations
- …We present a novel information visualization technique for the graphical representation of causal relations, that is based on the metaphor of color pools spreading over time on a piece of paper. Messages between processes in the system a#ect the colors of their respective pool, making it possible to…
- Cited by 5 (1 self) – Add To MetaCart
-
On Self-Stabilizing Wait-Free Clock Synchronization
- …A protocol which can tolerate any number of processors failing by ceasing operation for unbounded time and resuming operation (with or) without knowing that they were faulty is called wait-free; if it also works correctly even when the starting state of the system is arbitrary, it is called wait-f…
- Cited by 9 (3 self) – Add To MetaCart
-
A Simple, Fast and Scalable Non-Blocking Concurrent FIFO Queue for Shared Memory Multiprocessor Systems
- …A non-blocking FIFO queue algorithm for multiprocessor shared memory systems is presented in this paper. The algorithm is very simple, fast and scales very well in both symmetric and non-symmetric multiprocessor shared memory systems. Experiments on a 64-node SUN Enterprise 10000 -- a symmetric mult…
- Cited by 13 (5 self) – Add To MetaCart
-
A Simple, Fast Parallel Implementation of Quicksort and its Performance Evaluation on SUN Enterprise 10000
- …This paper looks into the behavior of a simple, fine-grain parallel extension of Quicksort for cache-coherent shared address space multiprocessors. Quicksoft has many nice properties: i) it is fast and general purpose; it is widely believed that Quicksoft is the fastest general-purpose sorting algor…
- Cited by 2 (1 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
