default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 33 matches
- 1995
- Keshav Pingali, Utpal Banerjee, David Gelernter, Alexandru Nicolau, David A. Padua:
Languages and Compilers for Parallel Computing, 7th International Workshop, LCPC'94, Ithaca, NY, USA, August 8-10, 1994, Proceedings. Lecture Notes in Computer Science 892, Springer 1995, ISBN 3-540-58868-X [contents] - 1994
- Gagan Agrawal, Joel H. Saltz:
Interprocedural Communication Optimizations for Distributed Memory Compilation. LCPC 1994: 283-299 - William F. Appelbe, Srinivas Doddapaneni, Charles Hardnett:
A New Algorithm for Global Optimization for Parallelism and Locality. LCPC 1994: 125-140 - Eduard Ayguadé, Jordi Garcia, Mercè Gironés, Jesús Labarta, Jordi Torres, Mateo Valero:
Detecting and Using Affinity in an Automatic Data Distribution Tool. LCPC 1994: 61-75 - David Bau, Induprakas Kodukula, Vladimir Kotlyar, Keshav Pingali, Paul Stodghill:
Solving Alignment Using Elementary Linear Algebra. LCPC 1994: 46-60 - Aart J. C. Bik, Peter M. W. Knijnenburg, Harry A. G. Wijshoff:
Reshaping Access Patterns for Generating Sparse Codes. LCPC 1994: 406-420 - William Blume, Rudolf Eigenmann, Keith Faigin, John Grout, Jay P. Hoeflinger, David A. Padua, Paul Petersen, William M. Pottenger, Lawrence Rauchwerger, Peng Tu, Stephen Weatherford:
Polaris: Improving the Effectiveness of Parallelizing Compilers. LCPC 1994: 141-154 - François Bodin, Elana D. Granston, Thierry Montaut:
Evaluating Two Loop Transformations for Reducing Multiple Writer False Sharing. LCPC 1994: 421-439 - Michael G. Burke, Paul R. Carini, Jong-Deok Choi, Michael Hind:
Flow-Insensitive Interprocedural Alias Analysis in the Presence of Pointers. LCPC 1994: 234-250 - Siddhartha Chatterjee, Robert Schreiber, Thomas J. Sheffler, John R. Gilbert:
Array Distribution in Data-Parallel Programs. LCPC 1994: 76-91 - Thomas Derby, Robert B. Schnabel, Benjamin G. Zorn:
EQ: Overview of a New Language Approach for Prototyping Scientific Computation. LCPC 1994: 391-405 - Henry G. Dietz, William E. Cohen, T. Muhammad, Timothy Mattox:
Compiler Techniques for Fine-Grain Execution on Workstation Clusters Using PAPERS. LCPC 1994: 31-45 - Paul Feautrier:
Fine-Grain Scheduling under Resource Constraints. LCPC 1994: 1-15 - Jeanne Ferrante:
Computing Communication Sets for Control Parallel Programs. LCPC 1994: 316-330 - Manish Gupta, Edith Schonberg, Harini Srinivasan:
A Unified Data-Flow Framework for Optimizing Communication. LCPC 1994: 266-282 - S. D. Kaushik, Chua-Huang Huang, P. Sadayappan:
Incremental Generation of Index Sets for Array Statement Execution on Distributed-Memory Machines. LCPC 1994: 251-265 - Wayne Kelly, William W. Pugh:
Finding Legal Reordering Transformations Using Mappings. LCPC 1994: 107-124 - Arvind Krishnamurthy, Katherine A. Yelick:
Optimizing Parallel SPMD Programs. LCPC 1994: 331-345 - Krishna Kunchithapadam, Barton P. Miller:
Optimizing Array Distributions in Data-Parallel Programs. LCPC 1994: 472-486 - Amy W. Lim, Monica S. Lam:
Communication-Free Parallelization via Affine Transformations. LCPC 1994: 92-106 - Calvin Lin, Lawrence Snyder:
SIMPLE Performance Results in ZPL. LCPC 1994: 361-375 - Piyush Mehrotra, Matthew Haines:
An Overview of the Opus Language and Runtime System. LCPC 1994: 346-360 - José E. Moreira, Constantine D. Polychronopoulos:
Autoscheduling in a Distributed Shared-Memory Environment. LCPC 1994: 455-471 - Tsuneo Nakanishi, Kazuki Joe, Akira Fukuda, Keijiro Araki, Hideki Saito, Constantine D. Polychronopoulos:
The Data Partitioning Graph: Extending Data and Control Dependencies for Data Partitioning. LCPC 1994: 170-185 - Rishiyur S. Nikhil:
Cid: A Parallel, "Shared-Memory" C for Distributed-Memory Machines. LCPC 1994: 376-390 - Steven Novack, Alexandru Nicolau:
Mutation Scheduling: A Unified Approach to Compiling for Fine-Grain Parallelism. LCPC 1994: 16-30 - J. Ramanujam, Ashvin Mathew:
Analysis of Event Synchronization in Parallel Programs. LCPC 1994: 300-315 - Satoshi Sekiguchi, Kei Hiraki:
Automatic Reduction Tree Generation for Fine-Grain Parallel Architectures when Iteration Count is Unknown. LCPC 1994: 487-496 - Vincent Sgro, Barbara G. Ryder:
Differences in Algorithmic Parallelism in Control Flow and Call Multigraphs. LCPC 1994: 217-233 - Jon A. Solworth, Bryan Reagan:
Parallelizing Tree Algorithms: Overhead vs. Parallelism. LCPC 1994: 440-454
skipping 3 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-12-15 10:00 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint