Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Anderson, James H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved conditions for bounded tardiness under EPDF Pfair multiprocessor scheduling
UmaMaheswari C. Devi
,
James H. Anderson
Journal of Computer and System Sciences
75
(7), 2009, pp. 388-420
A generic local-spin fetch-and-
\phi
-based mutual exclusion algorithm
James H. Anderson
,
Yong-Jik Kim
Journal Parallel Distributed Computing
67
(5), 2007, pp. 551-580
Supporting lock-free synchronization in Pfair-scheduled real-time systems
Philip Holman
,
James H. Anderson
Journal Parallel Distributed Computing
66
(1), 2006, pp. 47-67
Optimal rate-based scheduling on multiprocessors
Anand Srinivasan
,
James H. Anderson
Journal of Computer and System Sciences
72
(6), 2006, pp. 1094-1117
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
James H. Anderson
,
Anand Srinivasan
Journal of Computer and System Sciences
68
(1), 2004, pp. 157-204
A space- and time-efficient local-spin spin lock
Yong-Jik Kim
,
James H. Anderson
Information Processing Letters
84
(1), 2002, pp. 47-55
Optimal rate-based scheduling on multiprocessors
Anand Srinivasan
,
James H. Anderson
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 189-198
A simple proof technique for priority-scheduled systems
James H. Anderson
,
Mark Moir
,
Srikanth Ramamurthy
Information Processing Letters
77
(2-4), 2001, pp. 63-70
Universal constructions for large objects
James H. Anderson
,
Mark Moir
IEEE Transactions on Parallel and Distributed Systems
10
(12), 1999, pp. 1317-1332
Time/contention trade-offs for multiprocessor synchronization
James H. Anderson
,
Jae-Heon Yang
Information and Computation
124
(1), 1996, pp. 68-84
Universal constructions for large objects
James H. Anderson
,
Mark Moir
Lecture Notes in Computer Science
972
, 1995, pp. 168-182
Fast, long-lived renaming
Mark Moir
,
James H. Anderson
Proceedings of the 8th International Workshop on Distributed Algorithms, WDAG '94 (Terschelling, The Netherlands, September 29 - October 1, 1994)
LNCS 857
, 1994, pp. 141-155
The elusive atomic register
Ambuj K. Singh
,
James H. Anderson
,
Mohamed G. Gouda
Journal of the ACM
41
(2), 1994, March, pp. 311-339
Time bounds for mutual exclusion and related problems
Jae-Heon Yang
,
James H. Anderson
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 224-233
A fine-grained solution to the mutual exclusion problem
James H. Anderson
Acta Informatica
30
, 1993, pp. 249-265
Pseudo read-modify-write operations: Bounded wait-free implementations
James H. Anderson
,
Bojan Gros̑elj
Lecture Notes in Computer Science
579
, 1992, pp. 52-70
Atomic semantics of nonatomic programs
James H. Anderson
,
Mohamed G. Gouda
Information Processing Letters
28
, 1988, pp. 99-103