2008 |
54 | EE | Olivier Beaumont,
Larry Carter,
Jeanne Ferrante,
Arnaud Legrand,
Loris Marchal,
Yves Robert:
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications.
IEEE Trans. Parallel Distrib. Syst. 19(5): 698-709 (2008) |
2006 |
53 | EE | Xiaofeng Gao,
Allan Snavely,
Larry Carter:
Path Grammar Guided Trace Compression and Trace Approximation.
HPDC 2006: 57-68 |
52 | EE | Olivier Beaumont,
Larry Carter,
Jeanne Ferrante,
Arnaud Legrand,
Loris Marchal,
Yves Robert:
Centralized versus distributed schedulers for multiple bag-of-task applications.
IPDPS 2006 |
2005 |
51 | EE | Sagnik Nandy,
Larry Carter,
Jeanne Ferrante:
GUARD: Gossip Used for Autonomous Resource Detection.
IPDPS 2005 |
2004 |
50 | EE | Sagnik Nandy,
Larry Carter,
Jeanne Ferrante:
A-FAST: Autonomous Flow Approach to Scheduling Tasks.
HiPC 2004: 363-374 |
49 | EE | Barbara Kreaseck,
Larry Carter,
Henri Casanova,
Jeanne Ferrante:
On the Interference of Communication on Computation in Java.
IPDPS 2004 |
48 | EE | Cyril Banino,
Olivier Beaumont,
Larry Carter,
Jeanne Ferrante,
Arnaud Legrand,
Yves Robert:
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms.
IEEE Trans. Parallel Distrib. Syst. 15(4): 319-330 (2004) |
2003 |
47 | EE | Barbara Kreaseck,
Larry Carter,
Henri Casanova,
Jeanne Ferrante:
Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications.
IPDPS 2003: 26 |
46 | EE | Michelle Mills Strout,
Larry Carter,
Jeanne Ferrante:
Compile-time composition of run-time data and iteration reorderings.
PLDI 2003: 91-102 |
45 | EE | Larry Carter,
Jeanne Ferrante,
Clark D. Thomborson:
Folklore confirmed: reducible flow graphs are exponentially larger.
POPL 2003: 106-114 |
44 | EE | Karin Högstedt,
Larry Carter,
Jeanne Ferrante:
On the Parallel Execution Time of Tiled Loops.
IEEE Trans. Parallel Distrib. Syst. 14(3): 307-321 (2003) |
2002 |
43 | EE | Olivier Beaumont,
Arnaud Legrand,
Yves Robert,
Larry Carter,
Jeanne Ferrante:
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms.
IPDPS 2002 |
42 | EE | Michelle Mills Strout,
Larry Carter,
Jeanne Ferrante,
Jonathan Freeman,
Barbara Kreaseck:
Combining Performance Aspects of Irregular Gauss-Seidel Via Sparse Tiling.
LCPC 2002: 90-110 |
2001 |
41 | EE | Michelle Mills Strout,
Larry Carter,
Jeanne Ferrante:
Rescheduling for Locality in Sparse Matrix Computations.
International Conference on Computational Science (1) 2001: 137-148 |
40 | EE | Nick Mitchell,
Larry Carter,
Jeanne Ferrante:
A Modal Model of Memory.
International Conference on Computational Science (1) 2001: 81-96 |
2000 |
39 | | Larry Carter,
Jeanne Ferrante:
Languages and Compilers for Parallel Computing, 12th International Workshop, LCPC'99, La Jolla/San Diego, CA, USA, August 4-6, 1999, Proceedings
Springer 2000 |
38 | EE | Kang Su Gatlin,
Larry Carter:
Faster FFTs via Architecture-Cognizance.
IEEE PACT 2000: 249-260 |
37 | | Lori Carter,
Beth Simon,
Brad Calder,
Larry Carter,
Jeanne Ferrante:
Path Analysis and Renaming for Predicated Instruction Scheduling.
International Journal of Parallel Programming 28(6): 563-588 (2000) |
1999 |
36 | | Siddhartha Chatterjee,
Jan Prins,
Larry Carter,
Jeanne Ferrante,
Zhiyuan Li,
David C. Sehr,
Pen-Chung Yew:
Languages and Compilers for Parallel Computing, 11th International Workshop, LCPC'98, Chapel Hill, NC, USA, August 7-9, 1998, Proceedings
Springer 1999 |
35 | EE | Kang Su Gatlin,
Larry Carter:
Memory Hierarchy Considerations for Fast Transpose and Bit-Reversals.
HPCA 1999: 33- |
34 | EE | Nicholas Mitchell,
Larry Carter,
Jeanne Ferrante:
Localizing Non-Affine Array References.
IEEE PACT 1999: 192-202 |
33 | EE | Lori Carter,
Beth Simon,
Brad Calder,
Larry Carter,
Jeanne Ferrante:
Predicated Static Single Assignment.
IEEE PACT 1999: 245-255 |
32 | | Tung Nguyen,
Michelle Mills Strout,
Larry Carter,
Jeanne Ferrante:
Asynchronous Dynamic Load Balancing of Tiles.
PPSC 1999 |
31 | | Larry Carter,
John Feo,
Allan Snavely:
Performance and Programming Experience on the Tera MTA.
PPSC 1999 |
30 | EE | Karin Högstedt,
Larry Carter,
Jeanne Ferrante:
Selecting Tile Shape for Minimal Execution Time.
SPAA 1999: 201-211 |
1998 |
29 | EE | Michelle Mills Strout,
Larry Carter,
Jeanne Ferrante,
Beth Simon:
Schedule-Independent Storage Mapping for Loops.
ASPLOS 1998: 24-33 |
28 | EE | Larry Carter,
Kang Su Gatlin:
Towards an Optimal Bit-Reversal Permutation Program.
FOCS 1998: 544-555 |
27 | | Nicholas Mitchell,
Karin Högstedt,
Larry Carter,
Jeanne Ferrante:
Quantifying the Multi-Level Nature of Tiling Interactions.
International Journal of Parallel Programming 26(6): 641-670 (1998) |
1997 |
26 | | Nicholas Mitchell,
Larry Carter,
Jeanne Ferrante,
Karin Högstedt:
Quantifying the Multi-level Nature of Tiling Interactions.
LCPC 1997: 1-15 |
25 | EE | Karin Högstedt,
Larry Carter,
Jeanne Ferrante:
Determining the Idle Time of a Tiling.
POPL 1997: 160-173 |
1995 |
24 | EE | Larry Carter,
Jeanne Ferrante,
Susan Flynn Hummel:
Hierarchical tiling for improved superscalar performance.
IPPS 1995: 239-245 |
23 | | Larry Carter,
Jeanne Ferrante,
Susan Flynn Hummel:
Efficient Parallelism via Hierarchical Tiling.
PPSC 1995: 680-685 |
22 | | Bowen Alpern,
Larry Carter:
Message Compression for High Performance.
PPSC 1995: 814-819 |
21 | | Bowen Alpern,
Larry Carter:
Is Scalability Relevant? A Look at Sparse Matrix-Vector Product.
PPSC 1995: 850-851 |
20 | | Bowen Alpern,
Larry Carter:
The Myth of Scalable High Performance.
PPSC 1995: 857-859 |
19 | EE | Bowen Alpern,
Larry Carter,
Kang Su Gatlin:
Microparallelism and High-Performance Protein Matching.
SC 1995 |
18 | | Ramesh C. Agarwal,
Bowen Alpern,
Larry Carter,
Fred G. Gustavson,
David J. Klepacki,
Rick Lawrence,
Mohammad Zubair:
High-Performance Parallel Implementations of the NAS Kernel Benchmarks on the IBM SP2.
IBM Systems Journal 34(2): 263-272 (1995) |
1994 |
17 | | Bowen Alpern,
Larry Carter,
Ephraim Feig,
Ted Selker:
The Uniform Memory Hierarchy Model of Computation.
Algorithmica 12(2/3): 72-109 (1994) |
1993 |
16 | | Bowen Alpern,
Larry Carter,
M. Grayson,
C. Pelkie:
Orientation Maps: Techniques for Visualizing Rotations.
IEEE Visualization 1993: 183-188 |
15 | | Vasanth Bala,
Jeanne Ferrante,
Larry Carter:
Explicit Data Placement (XDP): A Methodology for Explicit Compile-Time Representation and Optimization.
PPOPP 1993: 139-148 |
1991 |
14 | | Bowen Alpern,
Larry Carter:
The Hyperbox.
IEEE Visualization 1991: 133-139 |
1990 |
13 | | Bowen Alpern,
Larry Carter,
Ephraim Feig:
Uniform Memory Hierarchies
FOCS 1990: 600-608 |
12 | | Bowen Alpern,
Larry Carter,
Ted Selker:
Visualizing Computer Memory Architectures.
IEEE Visualization 1990: 107-113 |
1988 |
11 | EE | Larry Carter,
Leendert M. Huisman,
Tom W. Williams:
TRIM: testability range by ignoring the memory.
IEEE Trans. on CAD of Integrated Circuits and Systems 7(1): 38-49 (1988) |
1987 |
10 | | Andrew P. Black,
Norman C. Hutchinson,
Eric Jul,
Henry M. Levy,
Larry Carter:
Distribution and Abstract Types in Emerald.
IEEE Trans. Software Eng. 13(1): 65-76 (1987) |
1986 |
9 | | Leendert M. Huisman,
Larry Carter,
Tom W. Williams:
TRIM : Testability Range by Ignoring the Memory.
ITC 1986: 474-479 |
1985 |
8 | | Larry Carter,
Larry J. Stockmeyer,
Mark N. Wegman:
The Complexity of Backtrack Searches (Preliminary Version)
STOC 1985: 449-457 |
1981 |
7 | | Mark N. Wegman,
Larry Carter:
New Hash Functions and Their Use in Authentication and Set Equality.
J. Comput. Syst. Sci. 22(3): 265-279 (1981) |
1979 |
6 | | Mark N. Wegman,
Larry Carter:
New Classes and Applications of Hash Functions
FOCS 1979: 175-182 |
5 | | Larry Carter,
Mark N. Wegman:
Universal Classes of Hash Functions.
J. Comput. Syst. Sci. 18(2): 143-154 (1979) |
1978 |
4 | | George Markowsky,
Larry Carter,
Mark N. Wegman:
Analysis of a Universal Class of Hash Functions.
MFCS 1978: 345-354 |
3 | | Larry Carter,
Robert W. Floyd,
John Gill,
George Markowsky,
Mark N. Wegman:
Exact and Approximate Membership Testers
STOC 1978: 59-65 |
1977 |
2 | | Larry Carter,
Mark N. Wegman:
Universal Classes of Hash Functions (Extended Abstract)
STOC 1977: 106-112 |
1 | | Larry Carter:
A Case Study of a New Code Generation Technique for Compilers.
Commun. ACM 20(12): 914-920 (1977) |