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=1239

• Cross-loop reuse analysis and its application to cache optimizations
  Keith Cooper, Ken Kennedy, Nathaniel McIntosh
  Lecture Notes in Computer Science 1239, 1997, pp. 1-19
• Locality analysis for distributed shared-memory multiprocessors
  Vivek Sarkar, Guang R. Gao, Shaohua Han
  Lecture Notes in Computer Science 1239, 1997, pp. 20-40
• Data distribution and loop parallelization for shared-memory multiprocessors
  Eduard Ayguadé, Jordi Garcia, M. Luz Grande, Jesús Labarta
  Lecture Notes in Computer Science 1239, 1997, pp. 41-55
• Data localization using loop aligned decomposition for macro-dataflow processing
  Akimasa Yoshida, Hironori Kasahara
  Lecture Notes in Computer Science 1239, 1997, pp. 56-74
• Exploiting monotone convergence functions in parallel programs
  William Pugh, Evan Rosser, Tatuaba Shpeisman
  Lecture Notes in Computer Science 1239, 1997, pp. 75-85
• Exact versus approximate array region analyses
  Béatrice Creusillet, François Irigoin
  Lecture Notes in Computer Science 1239, 1997, pp. 86-100
• Context-sensitive interprocedural analysis in the presence of dynamic aliasing
  Patrick W. Sathyanathan, Monica S. Lam
  Lecture Notes in Computer Science 1239, 1997, pp. 101-119
• Initial results for glacial variable analysis
  Tito Autrey, Michael Wolfe
  Lecture Notes in Computer Science 1239, 1997, pp. 120-134
• Compiler algorithms on If-conversion, speculative predicates assignment and predicated code optimizations
  Jesse Z. Fang
  Lecture Notes in Computer Science 1239, 1997, pp. 135-153
• Determining asynchronous pipeline execution times
  Val Donaldson, Jeanne Ferrante
  Lecture Notes in Computer Science 1239, 1997, pp. 154-174
• Compiler techniques for concurrent multithreading with hardware speculation support
  Zhiyuan Li, Jenn-Yuan Tsai, Xin Wang, Pen-Chung Yew, Bess Zheng
  Lecture Notes in Computer Science 1239, 1997, pp. 175-191
• Resource-directed loop pipelining
  Steven Novack, Alexandru Nicolau
  Lecture Notes in Computer Science 1239, 1997, pp. 192-206
• Integrating program optimizations and transformations with the scheduling of instruction level parallelism
  David A. Berson, Pohua Chang, Rajiv Gupta, Mary Lou Soffa
  Lecture Notes in Computer Science 1239, 1997, pp. 207-221
• Bidirectional scheduling: A new global code scheduling approach
  Pohua Chang, Dong-yuan Chen, Yong-fong Lee, Youfeng Wu, Utpal Banerjee
  Lecture Notes in Computer Science 1239, 1997, pp. 222-230
• Parametric computation of margins and of minimum cumulative register lifetime dates
  Benoit Dupont de Dinechin
  Lecture Notes in Computer Science 1239, 1997, pp. 231-245
• Global register allocation based on graph fusion
  Guei-Yuan Lueh, Thomas Gross, Ali-Reza Adl-Tabatabei
  Lecture Notes in Computer Science 1239, 1997, pp. 246-265
• Automatic parallelization for non-cache coherent multiprocessors
  Yunheung Paek, David A. Padua
  Lecture Notes in Computer Science 1239, 1997, pp. 266-284
• Lock coarsening: Eliminating lock overhead in automatically parallelized object-based programs
  Pedro Diniz, Martin Rinard
  Lecture Notes in Computer Science 1239, 1997, pp. 285-299
• Are parallel workstations the right target for parallelizing compilers?
  Rudolf Eigenmann, Insung Park, Michael J. Voss
  Lecture Notes in Computer Science 1239, 1997, pp. 300-314
• Optimal reordering and mapping of a class of nested-loops for parallel execution
  Chi-Chung Lam, P. Sadayappan, Rephael Wenger
  Lecture Notes in Computer Science 1239, 1997, pp. 315-329
• Communication-minimal tiling of uniform dependence loops .
  Jingling Xue
  Lecture Notes in Computer Science 1239, 1997, pp. 330-349
• Communication-minimal partitioning of parallel loops and data arrays for cache-coherent distributed-memory multiprocessors
  Rajeev Barua, David Kranz, Anant Agarwal
  Lecture Notes in Computer Science 1239, 1997, pp. 350-368
• Resource-based communication placement analysis
  Ken Kennedy, Ajay Sethi
  Lecture Notes in Computer Science 1239, 1997, pp. 369-388
• Statement-level communication-free partitioning techniques for parallelizing compilers
  Kuei-Ping Shih, Jang-Ping Sheu, Chua-Huang Huang
  Lecture Notes in Computer Science 1239, 1997, pp. 389-403
• Generalized overlap regions for communication optimization in data-parallel programs
  A. Venkatachar, J. Ramanujam, A. Thirumalai
  Lecture Notes in Computer Science 1239, 1997, pp. 404-419