Search the dblp DataBase

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. 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]
   
4. 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]
   
5. Lars Lundberg, Daniel Häggander, Kamilla Klonowska, Charlie Svahnberg
   Recovery Schemes for High Availability and High Performance Distributed Real-Time Computing. [Citation Graph (0, 0)][DBLP]
   IPDPS, 2003, pp:122- [Conf]
   
6. Lars Lundberg, Magnus Broberg, Kamilla Klonowska
   Evaluating Heuristic Scheduling Algorithms for High Performance Parallel Processing. [Citation Graph (0, 0)][DBLP]
   ISHPC, 2003, pp:160-173 [Conf]
   
7. 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]
   
8. 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]
   
9. 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]
   
10. 
    The maximum gain of increasing the number of preemptions in multiprocessor scheduling. [Citation Graph (, )][DBLP]