Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=892

• Fine-grain scheduling under resource constraints
  Paul Feautrier
  Lecture Notes in Computer Science 892, 1995, pp. 1-15
• Mutation scheduling: A unified approach to compiling for fine-grain parallelism
  Steven Novack, Alexandru Nicolau
  Lecture Notes in Computer Science 892, 1995, pp. 16-30
• Compiler techniques for fine-grain execution on workstation clusters using PAPERS
  H.G. Dietz, W.E. Cohen, T. Muhammad, T.I. Mattox
  Lecture Notes in Computer Science 892, 1995, pp. 31-45
• Solving alignment using elementary linear algebra
  David Bau, Induprakas Kodukula, Vladimir Kotlyar, Keshav Pingali, Paul Stodghill
  Lecture Notes in Computer Science 892, 1995, pp. 46-60
• Detecting and using affinity in an automatic data distribution tool
  Eduard Ayguadé, Jordi Garcia, Mercè Gironés, Jesus Labarta, Jordi Torres, Mateo Valero
  Lecture Notes in Computer Science 892, 1995, pp. 61-75
• Array distribution in data-parallel programs
  Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Thomas J. Sheffler
  Lecture Notes in Computer Science 892, 1995, pp. 76-91
• Communication-free parallelization via affine transformations
  Amy W. Lim, Monica S. Lam
  Lecture Notes in Computer Science 892, 1995, pp. 92-106
• Finding legal reordering transformations using mappings
  Wayne Kelly, William Pugh
  Lecture Notes in Computer Science 892, 1995, pp. 107-124
• A new algorithm for global optimization for parallelism and locality
  Bill Appelbe, Srinivas Doddapaneni, Charles Hardnett
  Lecture Notes in Computer Science 892, 1995, pp. 125-140
• Polaris:Improving the effectiveness of parallelizing compilers
  William Blume, Rudolf Eigenmann, Keith Faigin, John Grout, Jay Hoeflinger, David Padua, Paul Petersen, William Pottenger, Lawrence Rauchwerger, Peng Tu, Stephen Weatherford
  Lecture Notes in Computer Science 892, 1995, pp. 141-154
• A formal approach to the compilation of data-parallel languages
  J.A. Trescher, L.C. Breebaart, P.F.G. Dechering, A.B. Poelman, J.P.M. de Vreught, H.J. Sips
  Lecture Notes in Computer Science 892, 1995, pp. 155-169
• The data partitioning graph: Extending data and control dependencies for data partitioning
  Tsuneo Nakanishi, Kazuki Joe, Hideki Saito, Constantine D. Polychronopoulos, Akira Fukuda, Keijiro Araki
  Lecture Notes in Computer Science 892, 1995, pp. 170-185
• Detecting value-based scalar dependence
  Eric Stoltz, Michael Wolfe
  Lecture Notes in Computer Science 892, 1995, pp. 186-200
• Minimal data dependence abstractions for loop transformations
  Yi-Qing Yang, Corinne Ancourt, François Irigoin
  Lecture Notes in Computer Science 892, 1995, pp. 201-216
• Differences in algorithmic parallelism in control flow and call multigraphs
  Vincent Sgro, Barbara G. Ryder
  Lecture Notes in Computer Science 892, 1995, pp. 217-233
• Flow-insensitive interprocedural alias analysis in the presence of pointers
  Michael Burke, Paul Carini, Jong-Deok Choi, Michael Hind
  Lecture Notes in Computer Science 892, 1995, pp. 234-250
• Incremental generation of index sets for array statement execution on distributed-memory machines
  S.D. Kaushik, C.-H. Huang, P. Sadayappan
  Lecture Notes in Computer Science 892, 1995, pp. 251-265
• A unified data-flow framework for optimizing communication
  Manish Gupta, Edith Schonberg, Harini Srinivasan
  Lecture Notes in Computer Science 892, 1995, pp. 266-282
• Interprocedural communication optimizations for distributed memory compilation
  Gagan Agrawal, Joel Saltz
  Lecture Notes in Computer Science 892, 1995, pp. 283-299
• Analysis of event synchronization in parallel programs
  J. Ramanujam, A. Mathew
  Lecture Notes in Computer Science 892, 1995, pp. 300-315
• Computing communication sets for control parallel programs
  Jeanne Ferrante, Dirk Grunwald, Harini Srinivasan
  Lecture Notes in Computer Science 892, 1995, pp. 316-330
• Optimizing parallel SPMD programs
  Arvind Krishnamurthy, Katherine Yelick
  Lecture Notes in Computer Science 892, 1995, pp. 331-345
• An overview of the Opus language and runtime system
  Piyush Mehrotra, Matthew Haines
  Lecture Notes in Computer Science 892, 1995, pp. 346-360
• SIMPLE performance results in ZPL
  Calvin Lin, Lawrence Snyder
  Lecture Notes in Computer Science 892, 1995, pp. 361-375
• Cid: A parallel, "Shared-memory" C for distributed-memory machines
  Rishiyur S. Nikhil
  Lecture Notes in Computer Science 892, 1995, pp. 376-390