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
Hilfe
Suche: Author="Schwiegelshohn, Uwe"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Utilization of nonclairvoyant online schedules
Mohamed Eid Hussein
,
Uwe Schwiegelshohn
Theoretical Computer Science
362
(1-3), 2006, pp. 238-247
Preemptive weighted completion time scheduling of parallel jobs
Uwe Schwiegelshohn
SIAM Journal on Computing
33
(6), 2004, pp. 1280-1308
On an on-line scheduling problem for parallel jobs
Edwin Naroska
,
Uwe Schwiegelshohn
Information Processing Letters
81
(6), 2002, pp. 297-304
Benchmarks and standards for the evaluation of parallel job schedulers
Steve J. Chapin
,
Walfredo Cirne
,
Dror G. Feitelson
,
James Patton Jones
,
Scott T. Leutenegger
,
Uwe Schwiegelshohn
,
Warren Smith
,
David Talby
Lecture Notes in Computer Science
1659
, 1999, pp. 67-90
Benchmarks and standards for the evaluation of parallel job schedulers
Steve J. Chapin
,
Walfredo Cirne
,
Dror G. Feitelson
,
James P. Jones
,
Scott T. Leutenegger
,
Uwe Schwiegelshohn
,
Warren Smith
,
David Talby
Technical Report (1999-44), 1999
On the design and evaluation of job scheduling algorithms
Jochen Krallmann
,
Uwe Schwiegelshohn
,
Ramin Yahyapour
Proceedings of the 5th Annual Workshop on Job Scheduling Strategies for Parallel Processing - In Conjunction with IPPS/SPDP'99 (San Juan, Puerto Rico, April 16, 1999)
, 1999, pp. 17-30
On the design and evaluation of job scheduling algorithms
Jochen Krallmann
,
Uwe Schwiegelshohn
,
Ramin Yahyapour
Lecture Notes in Computer Science
1659
, 1999, pp. 17-42
List scheduling in the presence of branches - A theoretical evaluation
Franco Gasperoni
,
Uwe Schwiegelshohn
Theoretical Computer Science
196
(1-2), 1998, pp. 347-363
Smart SMART bounds for weighted response time scheduling
Uwe Schwiegelshohn
,
Walter Ludwig
,
Joel L. Wolf
,
John Turek
,
Philip S. Yu
SIAM Journal on Computing
28
(1), 1998, pp. 237-253
Improving first-come-first-serve job scheduling by gang scheduling
Uwe Schwiegelshohn
,
Ramin Yahyapour
Lecture Notes in Computer Science
1459
, 1998, pp. 180-198
Analysis of first-come-first-serve parallel job scheduling
Uwe Schwiegelshohn
,
Ramin Yahyapour
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 629-638
Theory and practice in parallel job scheduling
Dror G. Feitelson
,
Larry Rudolph
,
Uwe Schwiegelshohn
,
Kenneth C. Sevcik
,
Parkson Wong
Lecture Notes in Computer Science
1291
, 1997, pp. 1-34
Theory and practice in parallel job scheduling
Dror G. Feitelson
,
Larry Rudolph
,
Uwe Schwiegelshohn
,
Kenneth C. Sevcik
,
Parkson Wong
Technical Report (1997-18), 1997
Periodic and non-periodic min-max equations
Uwe Schwiegelshohn
,
Lothar Thiele
Lecture Notes in Computer Science
1256
, 1997, pp. 379-389
List scheduling in the presence of branches: A theoretical evaluation
Franco Gasperoni
,
Uwe Schwiegelshohn
Lecture Notes in Computer Science
1124
, 1996, pp. 515-526
A new scheduling method for parallel discrete-event simulation
Edwin Naroska
,
Uwe Schwiegelshohn
Lecture Notes in Computer Science
1124
, 1996, pp. 582-593
Preemptive weighted completion time scheduling of parallel jobs
Uwe Schwiegelshohn
Lecture Notes in Computer Science
1136
, 1996, pp. 39-51
Optimal loop scheduling on multiprocessors: A pumping lemma for
p
-processor schedules
Franco Gasperoni
,
Uwe Schwiegelshohn
,
John Turek
Lecture Notes in Computer Science
964
, 1995, pp. 51-56
Preemptive scheduling of parallel tasks
Uwe Schwiegelshohn
Technical Report (RC 20104 (88932)), 1995, June
Generating close to optimum loop schedules on parallel processors
Franco Gasperoni
,
Uwe Schwiegelshohn
Parallel Processing Letters
4
(4), 1994, pp. 391-403
Scheduling parallelizable tasks to minimize average response time
John Turek
,
Walter Ludwig
,
Joel L. Wolf
,
Lisa Fleischer
,
Prasoon Tiwari
,
Jason Glasgow
,
Uwe Schwiegelshohn
,
Philip S. Yu
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'94 (Cape May, New Jersey, June 27-29, 1994)
, 1994, pp. 200-209
Scheduling parallel tasks to minimize average response time
John Turek
,
Uwe Schwiegelshohn
,
Joel L. Wolf
,
Philip S. Yu
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 112-121
Analysis of free schedule in periodic graphs
Wolfgang Backes
,
Uwe Schwiegelshohn
,
Lothar Thiele
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'92 (San Diego, California, June 29 - July 1, 1992)
, 1992, pp. 333-342
Scheduling loops on parallel processors: A simple algorithm with close to optimum performance
Franco Gasperoni
,
Uwe Schwiegelshohn
Lecture Notes in Computer Science
634
, 1992, pp. 625-636
On optimal parallelization of arbitrary loops
Uwe Schwiegelshohn
,
Franco Gasperoni
,
Kemal Ebciog̑lu
Journal Parallel Distributed Computing
11
(2), 1991, February, pp. 130-134
Seiten 1
2
>