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="Lennerstad, H{\aa}kan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The maximum gain of increasing the number of preemptions in multiprocessor scheduling
Kamilla Klonowska
,
Lars Lundberg
,
Håkan Lennerstad
Acta Informatica
46
(4), 2009, pp. 285-295
Optimal combinatorial functions comparing multiprocess allocation performance in multiprocessor systems
Håkan Lennerstad
,
Lars Lundberg
SIAM Journal on Computing
29
(6), 2000, pp. 1816-1838
Optimal worst case formulas comparing cache memory associativity
Håkan Lennerstad
,
Lars Lundberg
SIAM Journal on Computing
30
(3), 2000, pp. 872-905
Optimal bounds on the gain of permitting dynamic allocation of communication channels in distributed computing
Lars Lundberg
,
Håkan Lennerstad
Acta Informatica
36
(6), 1999, pp. 425-446
Comparing the optimal performance of different MIMD multiprocessor architectures
Lars Lundberg
,
Håkan Lennerstad
Proceedings of the Merged 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, IPPS/SPDP'98 (Orlando, Florida, March 30 - April 3, 1998)
, 1998, pp. 498-502
Using recorded values for bounding the minimum completion time in multiprocessors
Lars Lundberg
,
Håkan Lennerstad
IEEE Transactions on Parallel and Distributed Systems
9
(4), 1998, pp. 346-358
Combinatorics for multiprocessor scheduling optimization and other contexts in computer architecture
Håkan Lennerstad
,
Lars Lundberg
Lecture Notes in Computer Science
1120
, 1996, pp. 341-347
An optimal execution time estimate of static versus dynamic allocation in multiprocessor systems
HÅkan Lennerstad
,
Lars Lundberg
SIAM Journal on Computing
24
(4), 1995, August, pp. 751-764