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 51 matches
- 1998
- Gheith A. Abandah, Edward S. Davidson:
Origin 2000 Design Enhancements for Communication Intensive Applications. IEEE PACT 1998: 30-39 - Mayez A. Al-Mouhamed, Homam Najjari:
Adaptive Scheduling of Computations and Communications on Distributed Memory Systems. IEEE PACT 1998: 366- - Wolfram Amme, Peter Braun, Eberhard Zehendner, François Thomasset:
Data Dependence Analysis of Assembly Code. IEEE PACT 1998: 340- - Boon Seong Ang, Derek Chiou, Larry Rudolph, Arvind:
The StarT-Voyager Parallel System. IEEE PACT 1998: 185- - Luc Bougé, Philip J. Hatcher, Raymond Namyst, Christian Pérez:
A Multithreaded Runtime Environment with Thread Migration for a HPF Data-Parallel Compiler. IEEE PACT 1998: 418-425 - Luc Bougé, Jean-François Méhaut, Raymond Namyst:
Madeleine: An Efficient and Portable Communication Interface for RPC-Based Multithreaded Environments. IEEE PACT 1998: 240-247 - Pierre Boulet, Paul Feautrier:
Scanning Polyhedra without Do-loops. IEEE PACT 1998: 4-11 - Michael K. Chen, Kunle Olukotun:
Exploiting Method-Level Parallelism in Single-Threaded Java Programs. IEEE PACT 1998: 176- - Yeh-Ching Chung, Ching-Hsien Hsu:
Efficient Methods for Multi-Dimensional Array Redistribution. IEEE PACT 1998: 410-417 - Albert Cohen, Jean-Francois Collard:
Instance-Wise Reaching Definition Analysis for Recursive Programs using Context-Free Transductions. IEEE PACT 1998: 332-339 - Jesús Corbal, Roger Espasa, Mateo Valero:
Command Vector Memory Systems: High Performance at Low Cost. IEEE PACT 1998: 68- - Brian L. Deitrich, Ben-Chung Cheng, Wen-mei W. Hwu:
Improving Static Branch Prediction in a Compiler. IEEE PACT 1998: 214-221 - Jack B. Dennis:
General Parallel Computation can be Performed with a Cycle-Free Heap. IEEE PACT 1998: 96- - Alexandre E. Eichenberger, S. M. Lobo:
Efficient Edge Profiling for ILP-Processors. IEEE PACT 1998: 294- - François Galilée, Jean-Louis Roch, Gerson G. H. Cavalheiro, Mathias Doreille:
Athapascan-1: On-Line Building Data Flow Graph in a Parallel Language. IEEE PACT 1998: 88-95 - Daniela Genius:
Handling Cross Interferences by Cyclic Cache Line Coloring. IEEE PACT 1998: 112-117 - Shin-ya Goto, Atsushi Kubota, Toshihiko Tanaka, Masahiro Goshima, Shin-ichiro Mori, Hiroshi Nakashima, Shinji Tomita:
Optimized Code Generation for Heterogeneous Computing Environment using Parallelizing Compiler TINPAR. IEEE PACT 1998: 426-433 - Martin Griebl, Christian Lengauer, Sabine Wetzel:
Code Generation in the Polytope Model. IEEE PACT 1998: 106-111 - Dirk Grunwald, Donald C. Lindsay, Benjamin G. Zorn:
Static Methods in Hybrid Branch Prediction. IEEE PACT 1998: 222-229 - Hwansoo Han, Chau-Wen Tseng:
Improving Compiler and Run-Time Support for Adaptive Irregular Codes. IEEE PACT 1998: 393-400 - Wissam Hlayhel, Daniel Litaize, Laurent Fesquet, Jacques Henri Collet:
Optical versus Electronic Bus for Address-Transactions in Future SMP Architectures. IEEE PACT 1998: 22-29 - Clara Jaramillo, Rajiv Gupta, Mary Lou Soffa:
Capturing the Effects of Code Improving Transformations. IEEE PACT 1998: 118-123 - Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanujam, Prithviraj Banerjee:
A Matrix-Based Approach to the Global Locality Optimization Problem. IEEE PACT 1998: 306-313 - Ireneusz Karkowski, Henk Corporaal:
Exploiting Fine- and Coarse-Grain Parallelism in Embedded Programs. IEEE PACT 1998: 60-67 - Artur Klauser, Todd M. Austin, Dirk Grunwald, Brad Calder:
Dynamic Hammock Predication for Non-Predicated Instruction Set Architectures. IEEE PACT 1998: 278-285 - Andreas Krall:
Efficient JavaVM Just-in-Time Compilation. IEEE PACT 1998: 205- - Venkata Krishnan, Josep Torrellas:
An Direct-Execution Framework for Fast and Accurate Simulation of Superscalar Processors. IEEE PACT 1998: 286-293 - Dattatraya Kulkarni:
Transformations for Improving Data Access Locality in Non-Perfectly Nested Loops. IEEE PACT 1998: 314-321 - Allen Leung, Krishna V. Palem, Amir Pnueli:
A Fast Algorithm for Scheduling Time-Constrained Instructions on Processors with ILP. IEEE PACT 1998: 158- - Jing-Chiou Liou, Michael A. Palis:
A New Heuristic for Scheduling Parallel Programs on Multiprocessor. IEEE PACT 1998: 358-365
skipping 21 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-11-16 09:11 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