| 2008 |
|---|
| 55 | EE | Peter Gardfjäll,
Erik Elmroth,
S. Lennart Johnsson,
Olle Mulmo,
Thomas Sandholm:
Scalable Grid-wide capacity allocation with the SweGrid Accounting System (SGAS).
Concurrency and Computation: Practice and Experience 20(18): 2089-2122 (2008) |
| 2007 |
|---|
| 54 | EE | Mehran Ahsant,
Jim Basney,
S. Lennart Johnsson:
Dynamic, context-aware, least-privilege grid delegation.
GRID 2007: 209-216 |
| 2006 |
|---|
| 53 | EE | Mehran Ahsant,
Jim Basney,
Olle Mulmo,
Adam J. Lee,
S. Lennart Johnsson:
Toward an On-Demand Restricted Delegation Mechanism for Grids.
GRID 2006: 152-159 |
| 52 | EE | Thomas Sandholm,
Peter Gardfjäll,
Erik Elmroth,
Olle Mulmo,
S. Lennart Johnsson:
A Service-Oriented Approach to Enforce Grid Resource Allocations.
Int. J. Cooperative Inf. Syst. 15(3): 439-459 (2006) |
| 2004 |
|---|
| 51 | EE | Thomas Sandholm,
Peter Gardfjäll,
Erik Elmroth,
S. Lennart Johnsson,
Olle Mulmo:
An OGSA-based accounting system for allocation enforcement across HPC centers.
ICSOC 2004: 279-288 |
| 2003 |
|---|
| 50 | EE | Dragan Mirkovic,
S. Lennart Johnsson:
CODELAB: A Developers' Tool for Efficient Code Generation and Optimization.
International Conference on Computational Science 2003: 729-738 |
| 2002 |
|---|
| 49 | EE | 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.
IPDPS 2002 |
| 2001 |
|---|
| 48 | EE | 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.
J. Parallel Distrib. Comput. 61(12): 1803-1826 (2001) |
| 2000 |
|---|
| 47 | EE | Dragan Mirkovic,
Rishad Mahasoom,
S. Lennart Johnsson:
An adaptive software library for fast Fourier transforms.
ICS 2000: 215-224 |
| 46 | EE | Y. Charlie Hu,
Guohua Jin,
S. Lennart Johnsson,
Dimitris Kehagias,
Nadia Shalaby:
HPFBench: a high performance Fortran benchmark suite.
ACM Trans. Math. Softw. 26(1): 99-149 (2000) |
| 1999 |
|---|
| 45 | | Olle Larsson,
M. Feig,
S. Lennart Johnsson:
Some Metacomputing Experiences for Scientific Applications.
Parallel Processing Letters 9(2): 243-252 (1999) |
| 1997 |
|---|
| 44 | EE | Y. Charlie Hu,
S. Lennart Johnsson,
Dimitris Kehagias,
Nadia Shalaby:
DPF: A Data Parallel Fortran Benchmark Suite.
IPPS 1997: 219-226 |
| 43 | | Y. Charlie Hu,
S. Lennart Johnsson,
Shang-Hua Teng:
High Performance FORTRAN for Highly Unstructured Problems.
PPOPP 1997: 13-24 |
| 42 | | Y. Charlie Hu,
S. Lennart Johnsson,
Shang-Hua Teng:
A Data-Parallel Adaptive N-body Method.
PPSC 1997 |
| 41 | | Y. Charlie Hu,
Shang-Hua Teng,
S. Lennart Johnsson:
A Data-Parallel Implementation of the Geometric Partitioning Algorithm.
PPSC 1997 |
| 40 | | Nadia Shalaby,
S. Lennart Johnsson:
Hierarchical Load Balancing for Parallel Fast Legendre Transforms.
PPSC 1997 |
| 39 | | Y. Charlie Hu,
S. Lennart Johnsson:
On the Accuracy of Anderson's Fast N-body Algorithm.
PPSC 1997 |
| 1996 |
|---|
| 38 | EE | Yu Hu,
S. Lennart Johnsson:
Implementing O(N) N-Body Algorithms Efficiently in Data-Parallel Languages.
Scientific Programming 5(4): 337-364 (1996) |
| 1995 |
|---|
| 37 | EE | Ted Nesson,
S. Lennart Johnsson:
ROMM Routing on Mesh and Torus Networks.
SPAA 1995: 275-287 |
| 36 | | S. Lennart Johnsson,
Ching-Tien Ho:
On the Conversion Between Binary Code and Binary-Reflected Gray Code on Binary Cubes.
IEEE Trans. Computers 44(1): 47-53 (1995) |
| 35 | EE | Kapil K. Mathur,
S. Lennart Johnsson:
All-to-All Communication on the Connection Machine CM-200.
Scientific Programming 4(4): 251-273 (1995) |
| 1994 |
|---|
| 34 | | 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.
HPCN 1994: 233-240 |
| 33 | | S. Lennart Johnsson,
Kapil K. Mathur:
Scientific Software Libraries for Scalable.
PARA 1994: 318-332 |
| 32 | | Ted Nesson,
S. Lennart Johnsson:
ROMM Routing: A Class of Efficient Minimal Routing Algorithms.
PCRCW 1994: 185-199 |
| 31 | | S. Lennart Johnsson,
Ching-Tien Ho:
Optimal communication channel utilization for matrix transposition and related permutations on binary cubes.
Discrete Applied Mathematics 53(1-3): 251-274 (1994) |
| 30 | | Ching-Tien Ho,
S. Lennart Johnsson:
Embedding hyperpyramids into hypercubes.
IBM Journal of Research and Development 38(1): 31-46 (1994) |
| 29 | EE | Alan Edelman,
Steve Heller,
S. Lennart Johnsson:
Index Transformation Algorithms in a Linear Algebra Framework.
IEEE Trans. Parallel Distrib. Syst. 5(12): 1302-1309 (1994) |
| 28 | | Ching-Tien Ho,
M. T. Raghunath,
S. Lennart Johnsson:
An Efficient Algorithms for Gray-to-Binary Permutation on Hypercubes.
J. Parallel Distrib. Comput. 20(1): 114-120 (1994) |
| 27 | | S. Lennart Johnsson,
Ching-Tien Ho:
Binary Cube Emulation of Butterfly Networks Encoded by Grad Code.
J. Parallel Distrib. Comput. 20(3): 261-279 (1994) |
| 26 | | Kapil K. Mathur,
S. Lennart Johnsson:
Multiplication of Matrices of Arbitrary Shape on a Data Parallel Computer.
Parallel Computing 20(7): 919-951 (1994) |
| 25 | EE | William George,
Ralph G. Brickner,
S. Lennart Johnsson:
POLYSHIFT Communications Software for the Connection Machine System CM-200.
Scientific Programming 3(1): 83-99 (1994) |
| 1993 |
|---|
| 24 | EE | S. Lennart Johnsson:
The Connection Machine Systems CM-5.
SPAA 1993: 365-366 |
| 23 | | S. Lennart Johnsson:
Minimizing the Communication Time for Matrix Multiplication on Multiprocessors.
Parallel Computing 19(11): 1235-1257 (1993) |
| 1992 |
|---|
| 22 | | S. Lennart Johnsson:
Massively Parallel Computing: Data Distribution and Communication.
Heinz Nixdorf Symposium 1992: 68-92 |
| 21 | | S. Lennart Johnsson,
Ching-Tien Ho:
Generalized Shuffle Permutations on Boolean Cubes.
J. Parallel Distrib. Comput. 16(1): 1-14 (1992) |
| 20 | | S. Lennart Johnsson,
Robert L. Krawitz:
Cooley-Tukey FFT on the Connection Machine.
Parallel Computing 18(11): 1201-1221 (1992) |
| 1991 |
|---|
| 19 | | S. Lennart Johnsson:
Performance Modeling of Distributed Memory Architectures.
J. Parallel Distrib. Comput. 12(4): 300-312 (1991) |
| 1990 |
|---|
| 18 | | Ching-Tien Ho,
S. Lennart Johnsson:
Embedding Three-Dimensional Meshes in Boolean Cubes by Graph Decomposition.
ICPP (3) 1990: 319-326 |
| 17 | | Ching-Tien Ho,
S. Lennart Johnsson:
Embedding Meshes in Boolean Cubes by Graph Decomposition.
J. Parallel Distrib. Comput. 8(4): 325-339 (1990) |
| 16 | | Pelle Olsson,
S. Lennart Johnsson:
A dataparallel implementation of an explicit method for the three-dimensional compressible Navier-Stokes equations.
Parallel Computing 14(1): 1-30 (1990) |
| 1989 |
|---|
| 15 | | Kapil K. Mathur,
S. Lennart Johnsson:
Data Parallel Algorithms for the Finite Element Method.
PPSC 1989: 257-267 |
| 14 | | Ching-Tien Ho,
S. Lennart Johnsson:
Optimizing Tridiagonal Solvers for Alternating Direction Methods on Boolean Cube Multiprocessors.
PPSC 1989: 96-98 |
| 13 | | Dimitris C. Gerogiannis,
Stelios C. Orphanoudakis,
S. Lennart Johnsson:
Histogram Computation on Distributed Memory Architectures.
Concurrency - Practice and Experience 1(2): 219-238 (1989) |
| 12 | | S. Lennart Johnsson,
Ching-Tien Ho:
Optimum Broadcasting and Personalized Communication in Hypercubes.
IEEE Trans. Computers 38(9): 1249-1268 (1989) |
| 11 | EE | Kapil K. Mathur,
S. Lennart Johnsson:
The Finite Element Method on a Data Parallel Computing System.
International Journal of High Speed Computing 1(1): 29-44 (1989) |
| 1987 |
|---|
| 10 | | Ching-Tien Ho,
S. Lennart Johnsson:
On the Embedding of Arbitrary Meshes in Boolean Cubes With Expansion Two Dilation Two.
ICPP 1987: 188-191 |
| 9 | | Abhiram G. Ranade,
S. Lennart Johnsson:
The Communication Efficiency fo Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integraton.
ICPP 1987: 479-482 |
| 8 | | S. Lennart Johnsson,
Ching-Tien Ho:
Algorithms for Matrix Transposition on Boolean n-Cube Configured Ensemble Architectures.
ICPP 1987: 621-629 |
| 7 | | S. Lennart Johnsson:
Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures.
J. Parallel Distrib. Comput. 4(2): 133-172 (1987) |
| 6 | EE | Jack Dongarra,
S. Lennart Johnsson:
Solving banded systems on a parallel processor.
Parallel Computing 5(1-2): 219-246 (1987) |
| 1986 |
|---|
| 5 | | Ching-Tien Ho,
S. Lennart Johnsson:
Distributed Routing Algorithms for Broadcasting and Personalized Communication in Hypercubes.
ICPP 1986: 640-648 |
| 1985 |
|---|
| 4 | EE | Tak-Kwong Ng,
S. Lennart Johnsson:
Generation of layouts from MOS circuit schematics: a graph theoretic approach.
DAC 1985: 39-45 |
| 3 | EE | S. Lennart Johnsson:
Solving Narrow Banded Systems on Ensemble Architectures.
ACM Trans. Math. Softw. 11(3): 271-288 (1985) |
| 1983 |
|---|
| 2 | | Peyyun Peggy Li,
S. Lennart Johnsson:
The Tree Machine: An Evaluation of Strategies for Reducing Program Loading Time.
ICPP 1983: 202-205 |
| 1981 |
|---|
| 1 | | Danny Cohen,
S. Lennart Johnsson:
A Mathematical Approach to the Design of VLSI Networks for Real-Time Computation Problems.
IEEE Real-Time Systems Symposium 1981: 32-40 |
