Остановите войну!
for scientists:
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 38 matches
- 1999
- Bowen Alpern, Mark Charney, Jong-Deok Choi, Anthony Cocchi, Derek Lieber:
Dynamic Linking on a Shared-Memory Multiprocessor. IEEE PACT 1999: 177-182 - D. K. Arvind, Robert D. Mullins:
A Fully Asynchronous Superscalar Architecture. IEEE PACT 1999: 17-22 - Greg Astfalk:
High-End Computing Technology: Where is it Heading? IEEE PACT 1999: 126 - Uwe Brinkschulte, C. Krakowski, Jochen Kreuzinger, Theo Ungerer:
A Multithreaded Java Microcontroller for Thread-Oriented Real-Time Event Handling. IEEE PACT 1999: 34-39 - Martin Burtscher, Benjamin G. Zorn:
Exploring Last n Value Prediction. IEEE PACT 1999: 66-76 - Ramon Canal, Joan-Manuel Parcerisa, Antonio González:
A Cost-Effective Clustered Architecture. IEEE PACT 1999: 160-168 - Franck Cappello, Olivier Richard:
Performance Characteristics of a Network of Commodity Multiprocessors for the NAS Benchmarks Using a Hybrid Memory Model. IEEE PACT 1999: 108-116 - Lori Carter, Beth Simon, Brad Calder, Larry Carter, Jeanne Ferrante:
Predicated Static Single Assignment. IEEE PACT 1999: 245-255 - Lucian Codrescu, D. Scott Wills:
On Dynamic Speculative Thread Partitioning and the MEM-Slicing Algorithm. IEEE PACT 1999: 40-46 - Alain Darte:
On the Complexity of Loop Fusion. IEEE PACT 1999: 149-157 - Basilio B. Fraguela, Ramon Doallo, Emilio L. Zapata:
Automatic Analytical Modeling for the Estimation of Cache Misses. IEEE PACT 1999: 221-231 - Satoshi Fujita, Tadanori Nakagawa:
Lower Bounding Techniques for the Multiprocessor Scheduling Problem with Communication Delay. IEEE PACT 1999: 212-220 - José González, Antonio González:
Control-Flow Speculation through Value Prediction for Superscalar Processors. IEEE PACT 1999: 57-65 - Martin Griebl, Paul Feautrier, Christian Lengauer:
On Index Set Splitting. IEEE PACT 1999: 274-282 - Manish Gupta, Sayak Mukhopadhyay, Navin Sinha:
Automatic Parallelization of Recursive Procedures. IEEE PACT 1999: 139-148 - Jeffrey Hammes, Robert Rinker, A. P. Wim Böhm, Walid A. Najjar, Bruce A. Draper, J. Ross Beveridge:
Cameron: High level Language Compilation for Reconfigurable Systems. IEEE PACT 1999: 236-244 - Derek L. Howard, Mikko H. Lipasti:
The Effect of Program Optimization on Trace Cache Efficiency. IEEE PACT 1999: 256-261 - Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanujam, Prithviraj Banerjee:
On Reducing False Sharing while Improving Locality on Shared Memory Multiprocessors. IEEE PACT 1999: 203-211 - Wolfgang Karl, Markus Leberecht, Martin Schulz:
Optimizing Data Locality for SCI-Based PC-Clusters with the SmiLE Monitoring Approach. IEEE PACT 1999: 169-176 - Venkata Krishnan, Josep Torrellas:
The Need for Fast Communication in Hardware-Based Speculative Chip Multiprocessors. IEEE PACT 1999: 24-33 - Zhiyuan Li:
Reducing Cache Conflicts by Partitioning and Privatizing Shared Arrays. IEEE PACT 1999: 183-190 - Srilatha Manne, Artur Klauser, Dirk Grunwald:
Branch Prediction Using Selective Branch Inversion. IEEE PACT 1999: 48-56 - Pierre Michaud, André Seznec, Stéphan Jourdan:
Exploring Instruction-Fetch Bandwidth Requirement in Wide-Issue Superscalar Processors. IEEE PACT 1999: 2-10 - Nicholas Mitchell, Larry Carter, Jeanne Ferrante:
Localizing Non-Affine Array References. IEEE PACT 1999: 192-202 - Enric Morancho, José M. Llabería, Àngel Olivé:
Looking at History to Filter Allocations in Prediction Tables. IEEE PACT 1999: 314-319 - Tsuneo Nakanishi, Kazuki Joe, Constantine D. Polychronopoulos, Akira Fukuda:
The Modulo Interval: A Simple and Practical Representation for Program Analysis. IEEE PACT 1999: 91-96 - Michael F. P. O'Boyle, Peter M. W. Knijnenburg:
Efficient Parallelization Using Combined Loop and Data Transformations. IEEE PACT 1999: 283-292 - Heiko Oehring, Ulrich Sigmund, Theo Ungerer:
MPEG-2 Video Decompression on Simultaneous Multithreaded Multimedia Processors. IEEE PACT 1999: 11-16 - Soner Önder, Jun Xu, Rajiv Gupta:
Caching and Predicting Branch Sequences for Improved Fetch Effectiveness. IEEE PACT 1999: 294-302 - Jeffrey T. Oplinger, David L. Heine, Monica S. Lam:
In Search of Speculative Thread-Level Parallelism. IEEE PACT 1999: 303-313
skipping 8 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-05-16 18:14 CEST 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