Name
Abstract | ||
|---|---|---|
Efficient algorithmic implementations of wait-free queue classes in the Real-time Specification for Java are presented in this paper. The algorithms are designed to exploit the unidirectional nature of these queues and the priority-based scheduling in the specification. The proposed implementations support multiple real-time threads to access the queue in a wait-free manner and at the same time keep the "Write Once, Run Anywhere" principle of Java. Experiments show our implementations outperform the reference implementations, especially with high priority tasks. In the implementations, we introduce a new solution to the "enabled late-write" problem discussed in [9]. The problem is caused by using only memory read/write operations. The new solution is more efficient, with respect to space complexity, compared to previous wait-free implementations, without losing in time complexity. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/RTAS.2006.45 | IEEE Real-Time Technology and Applications Symposium |
Field | DocType | ISBN |
Data structure,Job shop scheduling,Computer science,Scheduling (computing),Parallel computing,Queue,Real time Java,Algorithm,Real-time computing,Priority queue,Time complexity,Java | Conference | 0-7695-2516-4 |
Citations | PageRank | References |
1 | 0.35 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philippas Tsigas | 1 | 1200 | 99.58 |
| Yi Zhang | 2 | 214 | 10.52 |
| Daniel Cederman Philippas Tsigasy | 3 | 197 | 13.03 |
| Tord Dellsen | 4 | 1 | 0.35 |