The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

S. Lennart Johnsson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. S. Lennart Johnsson, Ching-Tien Ho
    Optimum Broadcasting and Personalized Communication in Hypercubes. [Citation Graph (1, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:9, pp:1249-1268 [Journal]
  2. Anirban Mandal, Anshuman Dasgupta, Ken Kennedy, Mark Mazina, Charles Koelbel, Gabriel Marin, Keith D. Cooper, John M. Mellor-Crummey, B. Liu, L. Johnsson
    Scheduling workflow applications in GrADS. [Citation Graph (0, 0)][DBLP]
    CCGRID, 2004, pp:790-797 [Conf]
  3. Tak-Kwong Ng, S. Lennart Johnsson
    Generation of layouts from MOS circuit schematics: a graph theoretic approach. [Citation Graph (0, 0)][DBLP]
    DAC, 1985, pp:39-45 [Conf]
  4. Zdenek Johan, Kapil K. Mathur, S. Lennart Johnsson, Thomas J. R. Hughes
    Mesh Decomposition and Communication Procedures for Finite Element Applications on the Connection Machine CM-5 System. [Citation Graph (0, 0)][DBLP]
    HPCN, 1994, pp:233-240 [Conf]
  5. Dragan Mirkovic, S. Lennart Johnsson
    CODELAB: A Developers' Tool for Efficient Code Generation and Optimization. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science, 2003, pp:729-738 [Conf]
  6. Ching-Tien Ho, S. Lennart Johnsson
    Distributed Routing Algorithms for Broadcasting and Personalized Communication in Hypercubes. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:640-648 [Conf]
  7. Ching-Tien Ho, S. Lennart Johnsson
    On the Embedding of Arbitrary Meshes in Boolean Cubes With Expansion Two Dilation Two. [Citation Graph (0, 0)][DBLP]
    ICPP, 1987, pp:188-191 [Conf]
  8. Ching-Tien Ho, S. Lennart Johnsson
    Embedding Three-Dimensional Meshes in Boolean Cubes by Graph Decomposition. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1990, pp:319-326 [Conf]
  9. S. Lennart Johnsson, Ching-Tien Ho
    Algorithms for Matrix Transposition on Boolean n-Cube Configured Ensemble Architectures. [Citation Graph (0, 0)][DBLP]
    ICPP, 1987, pp:621-629 [Conf]
  10. Peyyun Peggy Li, S. Lennart Johnsson
    The Tree Machine: An Evaluation of Strategies for Reducing Program Loading Time. [Citation Graph (0, 0)][DBLP]
    ICPP, 1983, pp:202-205 [Conf]
  11. Abhiram G. Ranade, S. Lennart Johnsson
    The Communication Efficiency fo Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integraton. [Citation Graph (0, 0)][DBLP]
    ICPP, 1987, pp:479-482 [Conf]
  12. Dragan Mirkovic, Rishad Mahasoom, S. Lennart Johnsson
    An adaptive software library for fast Fourier transforms. [Citation Graph (0, 0)][DBLP]
    ICS, 2000, pp:215-224 [Conf]
  13. Thomas Sandholm, Peter Gardfjäll, Erik Elmroth, S. Lennart Johnsson, Olle Mulmo
    An OGSA-based accounting system for allocation enforcement across HPC centers. [Citation Graph (0, 0)][DBLP]
    ICSOC, 2004, pp:279-288 [Conf]
  14. Keith D. Cooper, Anshuman Dasgupta, Ken Kennedy, Charles Koelbel, Anirban Mandal, Gabriel Marin, Mark Mazina, John M. Mellor-Crummey, Francine Berman, Henri Casanova, Andrew A. Chien, Holly Dail, Xin Liu, Alex Olugbile, Otto Sievert, Huaxia Xia, L. Johnsson, B. Liu, M. Patel, Daniel A. Reed, W. Deng, Celso L. Mendes, Zhiao Shi, Asim YarKhan, Jack Dongarra
    New Grid Scheduling and Rescheduling Methods in the GrADS Project. [Citation Graph (0, 0)][DBLP]
    IPDPS Next Generation Software Program - NSFNGS - PI Workshop, 2004, pp:- [Conf]
  15. Y. Charlie Hu, S. Lennart Johnsson, Dimitris Kehagias, Nadia Shalaby
    DPF: A Data Parallel Fortran Benchmark Suite. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:219-226 [Conf]
  16. Ken Kennedy, Mark Mazina, John M. Mellor-Crummey, Keith D. Cooper, Linda Torczon, Francine Berman, Andrew A. Chien, Holly Dail, Otto Sievert, Dave Angulo, Ian T. Foster, Ruth A. Aydt, Daniel A. Reed, Dennis Gannon, S. Lennart Johnsson, Carl Kesselman, Jack Dongarra, Sathish S. Vadhiyar, Richard Wolski
    Toward a Framework for Preparing and Executing Adaptive Grid Programs. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  17. S. Lennart Johnsson
    Massively Parallel Computing: Data Distribution and Communication. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:68-92 [Conf]
  18. S. Lennart Johnsson, Kapil K. Mathur
    Scientific Software Libraries for Scalable. [Citation Graph (0, 0)][DBLP]
    PARA, 1994, pp:318-332 [Conf]
  19. Ted Nesson, S. Lennart Johnsson
    ROMM Routing: A Class of Efficient Minimal Routing Algorithms. [Citation Graph (0, 0)][DBLP]
    PCRCW, 1994, pp:185-199 [Conf]
  20. Y. Charlie Hu, S. Lennart Johnsson, Shang-Hua Teng
    High Performance FORTRAN for Highly Unstructured Problems. [Citation Graph (0, 0)][DBLP]
    PPOPP, 1997, pp:13-24 [Conf]
  21. Ching-Tien Ho, S. Lennart Johnsson
    Optimizing Tridiagonal Solvers for Alternating Direction Methods on Boolean Cube Multiprocessors. [Citation Graph (0, 0)][DBLP]
    PPSC, 1989, pp:96-98 [Conf]
  22. Y. Charlie Hu, S. Lennart Johnsson
    On the Accuracy of Anderson's Fast N-body Algorithm. [Citation Graph (0, 0)][DBLP]
    PPSC, 1997, pp:- [Conf]
  23. Y. Charlie Hu, S. Lennart Johnsson, Shang-Hua Teng
    A Data-Parallel Adaptive N-body Method. [Citation Graph (0, 0)][DBLP]
    PPSC, 1997, pp:- [Conf]
  24. Y. Charlie Hu, Shang-Hua Teng, S. Lennart Johnsson
    A Data-Parallel Implementation of the Geometric Partitioning Algorithm. [Citation Graph (0, 0)][DBLP]
    PPSC, 1997, pp:- [Conf]
  25. Kapil K. Mathur, S. Lennart Johnsson
    Data Parallel Algorithms for the Finite Element Method. [Citation Graph (0, 0)][DBLP]
    PPSC, 1989, pp:257-267 [Conf]
  26. Nadia Shalaby, S. Lennart Johnsson
    Hierarchical Load Balancing for Parallel Fast Legendre Transforms. [Citation Graph (0, 0)][DBLP]
    PPSC, 1997, pp:- [Conf]
  27. Danny Cohen, S. Lennart Johnsson
    A Mathematical Approach to the Design of VLSI Networks for Real-Time Computation Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Real-Time Systems Symposium, 1981, pp:32-40 [Conf]
  28. S. Lennart Johnsson
    The Connection Machine Systems CM-5. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:365-366 [Conf]
  29. Ted Nesson, S. Lennart Johnsson
    ROMM Routing on Mesh and Torus Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1995, pp:275-287 [Conf]
  30. Dimitris C. Gerogiannis, Stelios C. Orphanoudakis, S. Lennart Johnsson
    Histogram Computation on Distributed Memory Architectures. [Citation Graph (0, 0)][DBLP]
    Concurrency - Practice and Experience, 1989, v:1, n:2, pp:219-238 [Journal]
  31. S. Lennart Johnsson, Ching-Tien Ho
    Optimal communication channel utilization for matrix transposition and related permutations on binary cubes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:251-274 [Journal]
  32. Ching-Tien Ho, S. Lennart Johnsson
    Embedding Meshes in Boolean Cubes by Graph Decomposition. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1990, v:8, n:4, pp:325-339 [Journal]
  33. Ching-Tien Ho, M. T. Raghunath, S. Lennart Johnsson
    An Efficient Algorithms for Gray-to-Binary Permutation on Hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:20, n:1, pp:114-120 [Journal]
  34. S. Lennart Johnsson
    Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1987, v:4, n:2, pp:133-172 [Journal]
  35. S. Lennart Johnsson
    Performance Modeling of Distributed Memory Architectures. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:12, n:4, pp:300-312 [Journal]
  36. S. Lennart Johnsson, Ching-Tien Ho
    Generalized Shuffle Permutations on Boolean Cubes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1992, v:16, n:1, pp:1-14 [Journal]
  37. S. Lennart Johnsson, Ching-Tien Ho
    Binary Cube Emulation of Butterfly Networks Encoded by Grad Code. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:20, n:3, pp:261-279 [Journal]
  38. Ken Kennedy, Bradley Broom, Keith D. Cooper, Jack Dongarra, Robert J. Fowler, Dennis Gannon, S. Lennart Johnsson, John M. Mellor-Crummey, Linda Torczon
    Telescoping Languages: A Strategy for Automatic Generation of Scientific Problem-Solving Systems from Annotated Libraries. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:12, pp:1803-1826 [Journal]
  39. Jack Dongarra, S. Lennart Johnsson
    Solving banded systems on a parallel processor. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1987, v:5, n:1-2, pp:219-246 [Journal]
  40. S. Lennart Johnsson
    Minimizing the Communication Time for Matrix Multiplication on Multiprocessors. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1993, v:19, n:11, pp:1235-1257 [Journal]
  41. S. Lennart Johnsson, Robert L. Krawitz
    Cooley-Tukey FFT on the Connection Machine. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1992, v:18, n:11, pp:1201-1221 [Journal]
  42. Kapil K. Mathur, S. Lennart Johnsson
    Multiplication of Matrices of Arbitrary Shape on a Data Parallel Computer. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1994, v:20, n:7, pp:919-951 [Journal]
  43. Pelle Olsson, S. Lennart Johnsson
    A dataparallel implementation of an explicit method for the three-dimensional compressible Navier-Stokes equations. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1990, v:14, n:1, pp:1-30 [Journal]
  44. Olle Larsson, M. Feig, S. Lennart Johnsson
    Some Metacomputing Experiences for Scientific Applications. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:2, pp:243-252 [Journal]
  45. S. Lennart Johnsson, Ching-Tien Ho
    On the Conversion Between Binary Code and Binary-Reflected Gray Code on Binary Cubes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1995, v:44, n:1, pp:47-53 [Journal]
  46. S. Lennart Johnsson
    Solving Narrow Banded Systems on Ensemble Architectures. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1985, v:11, n:3, pp:271-288 [Journal]
  47. Y. Charlie Hu, Guohua Jin, S. Lennart Johnsson, Dimitris Kehagias, Nadia Shalaby
    HPFBench: a high performance Fortran benchmark suite. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 2000, v:26, n:1, pp:99-149 [Journal]
  48. Alan Edelman, Steve Heller, S. Lennart Johnsson
    Index Transformation Algorithms in a Linear Algebra Framework. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1994, v:5, n:12, pp:1302-1309 [Journal]
  49. Catherine Putonti, Meizhuo Zhang, Lennart Johnsson, Yuriy Fofanov
    Two Challenges in Genomics That Can Benefit from Petascale Platforms. [Citation Graph (0, 0)][DBLP]
    Euro-Par Workshops, 2006, pp:313-322 [Conf]
  50. Mehran Ahsant, Jim Basney, Olle Mulmo, Adam J. Lee, S. Lennart Johnsson
    Toward an On-Demand Restricted Delegation Mechanism for Grids. [Citation Graph (0, 0)][DBLP]
    GRID, 2006, pp:152-159 [Conf]
  51. Ayaz Ali, Lennart Johnsson, Jaspal Subhlok
    Adaptive Computation of Self Sorting In-Place FFTs on Hierarchical Memory Architectures. [Citation Graph (0, 0)][DBLP]
    HPCC, 2007, pp:372-383 [Conf]
  52. Ayaz Ali, Lennart Johnsson, Jaspal Subhlok
    Scheduling FFT computation on SMP and multicore systems. [Citation Graph (0, 0)][DBLP]
    ICS, 2007, pp:293-301 [Conf]

  53. Developing Assays for the Detection of Influenza in Human Samples. [Citation Graph (, )][DBLP]


  54. Dynamic, context-aware, least-privilege grid delegation. [Citation Graph (, )][DBLP]


  55. Scheduling strategies for mapping application workflows onto the grid. [Citation Graph (, )][DBLP]


  56. Scalable Grid-wide capacity allocation with the SweGrid Accounting System (SGAS). [Citation Graph (, )][DBLP]


Search in 0.087secs, Finished in 0.090secs
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