According to our database1, Håkan Lennerstad authored at least 30 papers between 1994 and 2018.
Legend:Book In proceedings Article PhD thesis Other
List graphs and distance-consistent node labelings.
Generalized upper bounds on the minimum distance of PSK block codes.
IMA J. Math. Control & Information, 2015
Utilization-Based Schedulability Test of Real-Time Systems on Virtual Multiprocessors.
Proceedings of the 44th International Conference on Parallel Processing Workshops, 2015
Local Linear Time Convergence of Primal-Dual Energy Minimization Algorithm for Parallel Processing.
Proceedings of the IEEE 13th International Symposium on Parallel and Distributed Computing, 2014
Optimal Computer Crash Performance Precaution.
Discrete Mathematics & Theoretical Computer Science, 2012
Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization.
Discrete Mathematics, 2010
The maximum gain of increasing the number of preemptions in multiprocessor scheduling.
Acta Inf., 2009
Slack-based global multiprocessor scheduling of aperiodic tasks in parallel embedded real-time systems.
Proceedings of the 6th ACS/IEEE International Conference on Computer Systems and Applications, 2008
Guaranteeing Response Times for Aperiodic Tasks in Global Multiprocessor Scheduling.
Real-Time Systems, 2007
Optimal recovery schemes in fault tolerant distributed computing.
Acta Inf., 2005
Extended Golomb Rulers as the New Recovery Schemes in Distributed Dependable Computing.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005
Comparing the Optimal Performance of Parallel Architectures.
Comput. J., 2004
Using Modulo Rulers for Optimal Recovery Schemes in Distributed Computing.
Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2004), 2004
Using Optimal Golomb Rulers for Minimizing Collisions in Closed Hashing.
Proceedings of the Advances in Computer Science, 2004
Global Multiprocessor Scheduling of Aperiodic Tasks using Time-Independent Priorities.
Proceedings of the 9th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2003), 2003
Using Golomb Rulers for Optimal Recovery Schemes in Fault Tolerant Distributed Computing.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003
Comparing the Optimal Performance of Multiprocessor Architectures.
Proceedings of the 21st IASTED International Multi-Conference on Applied Informatics (AI 2003), 2003
Optimal Scheduling Combinatorics
An upper bound on the minimum Euclidean distance for block-coded phase-shift keying.
IEEE Trans. Information Theory, 2000
Optimal Worst Case Formulas Comparing Cache Memory Associativity.
SIAM J. Comput., 2000
Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems.
SIAM J. Comput., 2000
Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Computing.
Acta Inf., 1999
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors.
IEEE Trans. Parallel Distrib. Syst., 1998
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures.
Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998
Bounding the Gain of Changing the Number of Memory Modules in Shared Memory Multiprocessors.
Nord. J. Comput., 1997
Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Processing.
Proceedings of the On Principles Of Distributed Systems, 1997
Optimal Scheduling Results for Parallel Computing.
Proceedings of the Applications on Advanced Architecture Computers, 1996
An Optimal Execution Time Estimate of Static Versus Dynamic Allocation in Multiprocessor Systems.
SIAM J. Comput., 1995
Combinatorics for Multiprocessor Scheduling Optimization and Oter Contexts in Computer Architecture.
Proceedings of the Combinatorics and Computer Science, 1995
An optimal upper bound on the minimal completion time in distributed supercomputing.
Proceedings of the 8th international conference on Supercomputing, 1994