default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th ICS 1992: Washington, DC, USA
- Ken Kennedy, Constantine D. Polychronopoulos:
Proceedings of the 6th international conference on Supercomputing, ICS 1992, Washington, DC, USA, July 19-24, 1992. ACM 1992, ISBN 0-89791-485-6 - Seema Hiranandani, Ken Kennedy, Chau-Wen Tseng:
Evaluation of compiler optimizations for Fortran D on MIMD distributed memory machines. 1-14 - Roland Rühl:
Evaluation of compiler generated parallel programs on three multicomputers. 15-24 - Skef Wholey:
Automatic data mapping for distributed-memory parallel computers. 25-34 - J. E. Smith, W. R. Taylor:
Characterizing memory performance in vector multiprocessors. 35-44 - Jukka Helin:
Performance analysis of the CM-2, a massively parallel SIMD computer. 45-52 - Toshiaki Tarui, Takayuki Nakagawa, Noriyasu Ido, Machiko Asaie, Mamoru Sugie:
Evaluation of the lock mechanism in a snooping cache. 53-62 - Nadia Tawbi
, Paul Feautrier:
Processor allocation and loop scheduling on multiprocessor computers. 63-71 - David R. Wallace:
Low level scheduling using the hierarchical task graph. 72-81 - Kamlesh G. Kumar, Dattatraya Kulkarni, Anupam Basu:
Deriving good transformations for mapping nested loops on hierarchical parallel machines in polynomial time. 82-92 - Masahiro Yasugi, Satoshi Matsuoka, Akinori Yonezawa:
ABCL/onEM-4: a new software/hardware architecture for object-oriented concurrent computing on an extended dataflow supercomputer. 93-103 - William Y. Chen, Scott A. Mahlke, Wen-mei W. Hwu, Tokuzo Kiyohara, Pohua P. Chang:
Tolerating data access latency with register preloading. 104-113 - Falk Langhammer, Francis Wray:
Supercomputing and transputers. 114-128 - Ervan Darnell, John M. Mellor-Crummey, Ken Kennedy:
Automatic software cache coherence through vectorization. 129-138 - Hoichi Cheong:
Life span strategy - a compiler-based approach to cache coherence. 139-148 - Mateo Valero, Tomás Lang, Eduard Ayguadé:
Conflict-free access of vectors with power-of-two strides. 149-156 - Sekhar R. Sarukkai, Dennis Gannon:
Parallel program visualization using SIEVE.1. 157-166 - Peter W. Newton, James C. Browne:
The CODE 2.0 graphical parallel programming language. 167-177 - Özalp Babaoglu, Lorenzo Alvisi, Alessandro Amoroso, Renzo Davoli, Luigi-Alberto Giachini:
Paralex: an environment for parallel programming in distributed systems. 178-187 - Gail A. Alverson, Robert Alverson, David Callahan, Brian D. Koblenz, Allan Porterfield, Burton J. Smith:
Exploiting heterogeneous parallelism on a multithreaded multiprocessor. 188-197 - Gabriel M. Silberman, Kemal Ebcioglu:
An architectural framework for migration from CISC to higher performance platforms. 198-215 - John R. Gurd, David F. Snelling:
Manchester data-flow: a progress report. 216-225 - François Masdupuy:
Array abstractions using semantic analysis of trapezoid congruences. 226-235 - Yong-Fong Lee, Barbara G. Ryder:
A comprehensive approach to parallel data flow analysis. 236-247 - Peter B. Ladkin, Barbara Simons:
Compile-time analysis of communicating processes. 248-259 - William H. Mangione-Smith, Santosh G. Abraham, Edward S. Davidson:
Register requirements of pipelined processors. 260-271 - Tetsuo Hironaka, Takashi Hashimoto, Keizo Okazaki, Kazuaki J. Murakami, Shinji Tomita:
Benchmarking a vector-processor prototype based on multithreaded streaming/FIFO vector (MSFV) architecture. 272-281 - Zhiyong Liu, Xiaobo Li, Jia-Huai You:
On storage schemes for parallel array access. 282-291 - Christine Eisenbeis, Jean-Claude Sogno:
A general algorithm for data dependence analysis. 292-302 - Kleanthis Psarris:
On exact data dependence analysis. 303-312 - Zhiyuan Li:
Array privatization for parallel execution of loops. 313-322 - Ken Kennedy, Kathryn S. McKinley:
Optimizing for parallelism and data locality. 323-334 - Michael F. P. O'Boyle, G. A. Hedayat:
A transformational approach to compiling Sisal for distributed memory architectures. 335-346 - Thomas Fahringer, Roman Blasko, Hans P. Zima:
Automatic performance prediction to support parallelization of Fortran programs for massively parallel systems. 347-356 - Manish Gupta, Prithviraj Banerjee:
A methodology for high-level synthesis of communication on multicomputers. 357-367 - Jean-Marc Jézéquel, Françoise André, F. Bergheul:
A parallel execution environment for a sequential object oriented language. 368-376 - S. P. Cheng, Sivarama P. Dandamudi:
Scheduling in parallel systems with a hierarchical organization of tasks. 377-386 - Graham F. Carey, Joe Schmidt, Vineet Singh, Dennis Yelton:
A scalable, object-oriented finite element solver for partial differential equations on multicomputers. 387-396 - Luiz De Rose, Kyle A. Gallivan, Efstratios Gallopoulos:
Experiments with an ocean circulation model on CEDAR. 397-408 - Guoliang Xue, Robert S. Maier, J. Ben Rosen:
Minimizing the Lennard-Jones potential function on a massively parallel computer. 409-416 - David Gelernter, David Kaminsky:
Supercomputing out of recycled garbage: preliminary experience with Piranha. 417-427 - Tao Yang, Apostolos Gerasoulis:
PYRROS: static task scheduling and code generation for message passing multiprocessors. 428-437 - Craig M. Chase, Kay Crowley, Joel H. Saltz, Anthony P. Reeves:
Compiler and runtime support for irregularly coupled regular meshes. 438-446 - Hsin-Chu Chen:
Parallel SAS multicluster algorithms for solving linear systems with reflexive coefficient matrices. 447-455 - Charles D. Swanson, Anthony T. Chronopoulos:
Orthogonal s-step methods for nonsymmetric linear systems of equations. 456-465 - Haigeng Wang, Alexandru Nicolau:
Speedup of band linear recurrences in the presence of resource constraints. 466-477 - Chiou-Ming Huang, Dianne P. O'Leary:
Preconditioning parallel multisplittings for solving linear systems of equations. 478-484
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
