S. Lennart Johnsson - researchr alias

researchr

You are not signed in
Sign in
Sign up

2008

Scalable Grid-wide capacity allocation with the SweGrid Accounting System (SGAS)Peter Gardfjäll, Erik Elmroth, S. Lennart Johnsson, Olle Mulmo, Thomas Sandholm. concurrency, 20(18):2089-2122, 2008. [doi]

Automatic Generation of FFT for Translations of Multipole Expansions in Spherical HarmonicsJakub Kurzak, Dragan Mirkovic, B. Montgomery Pettitt, S. Lennart Johnsson. ijhpca, 22(2):219-230, 2008. [doi]

2007

Dynamic, context-aware, least-privilege grid delegationMehran Ahsant, Jim Basney, S. Lennart Johnsson. grid 2007: 209-216 [doi]

2006

Toward an On-Demand Restricted Delegation Mechanism for GridsMehran Ahsant, Jim Basney, Olle Mulmo, Adam J. Lee, S. Lennart Johnsson. ccgrid 2006: 152-159 [doi]

A Service-Oriented Approach to Enforce Grid Resource AllocationsThomas Sandholm, Peter Gardfjäll, Erik Elmroth, Olle Mulmo, S. Lennart Johnsson. ijcis, 15(3):439-459, 2006. [doi]

2005

Scheduling strategies for mapping application workflows onto the gridAnirban Mandal, Ken Kennedy, Charles Koelbel, Gabriel Marin, John M. Mellor-Crummey, Bo Liu, S. Lennart Johnsson. hpdc 2005: 125-134 [doi]

2004

Automatic Performance Tuning for Fast Fourier TransformsDragan Mirkovic, S. Lennart Johnsson. ijhpca, 18(1):47-64, 2004. [doi]

An OGSA-based accounting system for allocation enforcement across HPC centersThomas Sandholm, Peter Gardfjäll, Erik Elmroth, S. Lennart Johnsson, Olle Mulmo. icsoc 2004: 279-288 [doi]

2003

CODELAB: A Developers Tool for Efficient Code Generation and OptimizationDragan Mirkovic, S. Lennart Johnsson. iccS 2003: 729-738 [doi]

2002

2001

2000

HPFBench: a high performance Fortran benchmark suiteY. Charlie Hu, Guohua Jin, S. Lennart Johnsson, Dimitris Kehagias, Nadia Shalaby. TOMS, 26(1):99-149, 2000. [doi]

An adaptive software library for fast Fourier transformsDragan Mirkovic, Rishad Mahasoom, S. Lennart Johnsson. ics 2000: 215-224 [doi]

1999

Some Metacomputing Experiences for Scientific ApplicationsOlle Larsson, M. Feig, S. Lennart Johnsson. ppl, 9(2):243-252, 1999.

1997

1996

Implementing O(N) N-Body Algorithms Efficiently in Data-Parallel LanguagesYu Hu, S. Lennart Johnsson. sp, 5(4):337-364, 1996. [doi]

1995

On the Conversion Between Binary Code and Binary-Reflected Gray Code on Binary CubesS. Lennart Johnsson, Ching-Tien Ho. TC, 44(1):47-53, 1995.

All-to-All Communication on the Connection Machine CM-200Kapil K. Mathur, S. Lennart Johnsson. sp, 4(4):251-273, 1995. [doi]

ROMM Routing on Mesh and Torus NetworksTed Nesson, S. Lennart Johnsson. spaa 1995: 275-287 [doi]

1994

Index Transformation Algorithms in a Linear Algebra FrameworkAlan Edelman, Steve Heller, S. Lennart Johnsson. tpds, 5(12):1302-1309, 1994. [doi]

POLYSHIFT Communications Software for the Connection Machine System CM-200William George, Ralph G. Brickner, S. Lennart Johnsson. sp, 3(1):83-99, 1994. [doi]

Embedding hyperpyramids into hypercubesChing-Tien Ho, S. Lennart Johnsson. ibmrd, 38(1):31-46, 1994.

An Efficient Algorithms for Gray-to-Binary Permutation on HypercubesChing-Tien Ho, M. T. Raghunath, S. Lennart Johnsson. jpdc, 20(1):114-120, 1994.

Mesh Decomposition and Communication Procedures for Finite Element Applications on the Connection Machine CM-5 SystemZdenek Johan, Kapil K. Mathur, S. Lennart Johnsson, Thomas J. R. Hughes. hpcn 1994: 233-240

Optimal communication channel utilization for matrix transposition and related permutations on binary cubesS. Lennart Johnsson, Ching-Tien Ho. DAM, 53(1-3):251-274, 1994.

Binary Cube Emulation of Butterfly Networks Encoded by Grad CodeS. Lennart Johnsson, Ching-Tien Ho. jpdc, 20(3):261-279, 1994.

Scientific Software Libraries for ScalableS. Lennart Johnsson, Kapil K. Mathur. para 1994: 318-332

Multiplication of Matrices of Arbitrary Shape on a Data Parallel ComputerKapil K. Mathur, S. Lennart Johnsson. pc, 20(7):919-951, 1994.

ROMM Routing: A Class of Efficient Minimal Routing AlgorithmsTed Nesson, S. Lennart Johnsson. pcrcw 1994: 185-199

1993

Minimizing the Communication Time for Matrix Multiplication on MultiprocessorsS. Lennart Johnsson. pc, 19(11):1235-1257, 1993.

The Connection Machine Systems CM-5S. Lennart Johnsson. spaa 1993: 365-366 [doi]

1992

Generalized Shuffle Permutations on Boolean CubesS. Lennart Johnsson, Ching-Tien Ho. jpdc, 16(1):1-14, 1992.

Cooley-Tukey FFT on the Connection MachineS. Lennart Johnsson, Robert L. Krawitz. pc, 18(11):1201-1221, 1992.

Massively Parallel Computing: Data Distribution and CommunicationS. Lennart Johnsson. nixdorf 1993: 68-92

1991

Performance Modeling of Distributed Memory ArchitecturesS. Lennart Johnsson. jpdc, 12(4):300-312, 1991.

1990

Embedding Three-Dimensional Meshes in Boolean Cubes by Graph DecompositionChing-Tien Ho, S. Lennart Johnsson. icpp 1990: 319-326

Embedding Meshes in Boolean Cubes by Graph DecompositionChing-Tien Ho, S. Lennart Johnsson. jpdc, 8(4):325-339, 1990.

A dataparallel implementation of an explicit method for the three-dimensional compressible Navier-Stokes equationsPelle Olsson, S. Lennart Johnsson. pc, 14(1):1-30, 1990.

1989

1987

1986

Distributed Routing Algorithms for Broadcasting and Personalized Communication in HypercubesChing-Tien Ho, S. Lennart Johnsson. icpp 1986: 640-648

1985

Solving Narrow Banded Systems on Ensemble ArchitecturesS. Lennart Johnsson. TOMS, 11(3):271-288, 1985. [doi]

Generation of layouts from MOS circuit schematics: a graph theoretic approachTak-Kwong Ng, S. Lennart Johnsson. dac 1985: 39-45 [doi]

1983

The Tree Machine: An Evaluation of Strategies for Reducing Program Loading TimePeyyun Peggy Li, S. Lennart Johnsson. icpp 1983: 202-205

1981

A Mathematical Approach to the Design of VLSI Networks for Real-Time Computation ProblemsDanny Cohen, S. Lennart Johnsson. rtss 1981: 32-40