The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Håkan Lennerstad: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lars Lundberg, Kamilla Klonowska, Magnus Broberg, Håkan Lennerstad
    Comparing the Optimal Performance of Multiprocessor Architectures. [Citation Graph (0, 0)][DBLP]
    Applied Informatics, 2003, pp:750-760 [Conf]
  2. Lars Lundberg, Håkan Lennerstad, Kamilla Klonowska, Göran Gustafsson
    Using Optimal Golomb Rulers for Minimizing Collisions in Closed Hashing. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2004, pp:157-168 [Conf]
  3. Håkan Lennerstad, Lars Lundberg
    Combinatorics for Multiprocessor Scheduling Optimization and Oter Contexts in Computer Architecture. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:341-347 [Conf]
  4. Lars Lundberg, Håkan Lennerstad
    An optimal upper bound on the minimal completion time in distributed supercomputing. [Citation Graph (0, 0)][DBLP]
    International Conference on Supercomputing, 1994, pp:196-203 [Conf]
  5. Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad
    Using Golomb Rulers for Optimal Recovery Schemes in Fault Tolerant Distributed Computing. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:213- [Conf]
  6. Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad, Charlie Svahnberg
    Extended Golomb Rulers as the New Recovery Schemes in Distributed Dependable Computing. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  7. Lars Lundberg, Håkan Lennerstad
    Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:498-502 [Conf]
  8. Lars Lundberg, Håkan Lennerstad
    Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Processing. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1997, pp:29-44 [Conf]
  9. Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad, Charlie Svahnberg
    Using Modulo Rulers for Optimal Recovery Schemes in Distributed Computing. [Citation Graph (0, 0)][DBLP]
    PRDC, 2004, pp:133-142 [Conf]
  10. Lars Lundberg, Håkan Lennerstad
    Global Multiprocessor Scheduling of Aperiodic Tasks using Time-Independent Priorities. [Citation Graph (0, 0)][DBLP]
    IEEE Real Time Technology and Applications Symposium, 2003, pp:170-180 [Conf]
  11. Kamilla Klonowska, Håkan Lennerstad, Lars Lundberg, Charlie Svahnberg
    Optimal recovery schemes in fault tolerant distributed computing. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2005, v:41, n:6, pp:341-365 [Journal]
  12. Lars Lundberg, Håkan Lennerstad
    Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Computing. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1999, v:36, n:6, pp:425-446 [Journal]
  13. Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad, Magnus Broberg
    Comparing the Optimal Performance of Parallel Architectures. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2004, v:47, n:5, pp:527-544 [Journal]
  14. Lars Lundberg, Håkan Lennerstad
    Bounding the Gain of Changing the Number of Memory Modules in Shared Memory Multiprocessors. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1997, v:4, n:2, pp:233-258 [Journal]
  15. Lars Lundberg, Håkan Lennerstad
    Guaranteeing Response Times for Aperiodic Tasks in Global Multiprocessor Scheduling. [Citation Graph (0, 0)][DBLP]
    Real-Time Systems, 2007, v:35, n:2, pp:135-151 [Journal]
  16. Håkan Lennerstad, Lars Lundberg
    Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:6, pp:1816-1838 [Journal]
  17. Håkan Lennerstad, Lars Lundberg
    Optimal Worst Case Formulas Comparing Cache Memory Associativity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:3, pp:872-905 [Journal]
  18. Håkan Lennerstad, Lars Lundberg
    An Optimal Execution Time Estimate of Static Versus Dynamic Allocation in Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:751-764 [Journal]
  19. Magnus Nilsson, Håkan Lennerstad
    An upper bound on the minimum Euclidean distance for block-coded phase-shift keying. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:656-662 [Journal]
  20. Lars Lundberg, Håkan Lennerstad
    Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:4, pp:346-358 [Journal]

  21. Slack-based global multiprocessor scheduling of aperiodic tasks in parallel embedded real-time systems. [Citation Graph (, )][DBLP]


  22. The maximum gain of increasing the number of preemptions in multiprocessor scheduling. [Citation Graph (, )][DBLP]


  23. Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002