Остановите войну!
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 29 matches
- 1998
- Haitham Akkary, Michael A. Driscoll:
A Dynamic Multithreading Processor. MICRO 1998: 226-236 - Guido Araujo, Paulo Centoducatte, Mario Lúcio Côrtes, Ricardo Pannain:
Code Compression Based on Operand Factorization. MICRO 1998: 194-201 - Ravi Bhargava, Lizy Kurian John, Brian L. Evans, Ramesh Radhakrishnan:
Evaluating MMX Technology Using DSP and Multimedia Applications. MICRO 1998: 37-46 - Ben-Chung Cheng, Daniel A. Connors, Wen-mei W. Hwu:
Compiler-Directed Early Load-Address Generation. MICRO 1998: 138-147 - Karel Driesen, Urs Hölzle:
The Cascaded Predictor: Economical and Adaptive Branch Target Prediction. MICRO 1998: 249-258 - Avinoam N. Eden, Trevor N. Mudge:
The YAGS Branch Prediction Scheme. MICRO 1998: 69-77 - Alexandre Farcy, Olivier Temam, Roger Espasa, Toni Juan:
Dataflow Analysis of Branch Mispredictions and Its Application to Early Resolution of Branch Outcomes. MICRO 1998: 59-68 - Daniel H. Friendly, Sanjay J. Patel, Yale N. Patt:
Putting the Fill Unit to Work: Dynamic Optimizations for Trace Cache Microprocessors. MICRO 1998: 173-181 - Stéphan Jourdan, Ronny Ronen, Michael Bekerman, Bishara Shomar, Adi Yoaz:
A Novel Renaming Scheme to Exploit Value Temporal Locality Through Physical Register Reuse and Unification. MICRO 1998: 216-225 - John Kalamatianos, David R. Kaeli:
Predicting Indirect Branches via Data Compression. MICRO 1998: 272-281 - Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanujam, Prithviraj Banerjee:
Improving Locality Using Loop and Data Transformations in an Integrated Framework. MICRO 1998: 285-297 - Sangwook P. Kim, Gary S. Tyson:
Analyzing the Working Set Characteristics of Branch Execution. MICRO 1998: 49-58 - Timothy Kong, Kent D. Wilken:
Precise Register Allocation for Irregular Architectures. MICRO 1998: 297-307 - Corinna G. Lee, Mark G. Stoodley:
Simple Vector Microprocessors for Multimedia Applications. MICRO 1998: 25-36 - David López, Josep Llosa, Mateo Valero, Eduard Ayguadé:
Widening Resources: A Cost-effective Technique for Aggressive ILP Architectures. MICRO 1998: 237-246 - Chi-Keung Luk, Todd C. Mowry:
Cooperative Prefetching: Compiler and Hardware Support for Effective Instruction Prefetching in Modern Processors. MICRO 1998: 182-194 - Erik Nystrom, Alexandre E. Eichenberger:
Effective Cluster Assignment for Modulo Scheduling. MICRO 1998: 103-114 - Emre Özer, Sanjeev Banerjia, Thomas M. Conte:
Unified Assign and Schedule: A New Approach to Scheduling for Clustered Register File Microarchitectures. MICRO 1998: 308-315 - Glenn Reinman, Brad Calder:
Predictive Techniques for Aggressive Load Speculation. MICRO 1998: 127-137 - Scott Rixner, William J. Dally, Ujval J. Kapasi, Brucek Khailany, Abelardo López-Lagunas, Peter R. Mattson, John D. Owens:
A Bandwidth-efficient Architecture for Media Processing. MICRO 1998: 3-13 - Lambert Schaelicke, Al Davis:
Improving I/O Performance with a Conditional Store Buffer. MICRO 1998: 160-169 - SangMin Shim, Soo-Mook Moon:
Split-path Enhanced Pipeline Scheduling for Loops with Control Flows. MICRO 1998: 93-102 - Kevin Skadron, Pritpal S. Ahuja, Margaret Martonosi, Douglas W. Clark:
Improving Prediction for Procedure Returns with Return-address-stack Repair Mechanisms. MICRO 1998: 259-271 - Avinash Sodani, Gurindar S. Sohi:
Understanding the Differences Between Value Prediction and Instruction Reuse. MICRO 1998: 205-215 - Srikanth T. Srinivasan, Alvin R. Lebeck:
Load Latency Tolerance in Dynamically Scheduled Processors. MICRO 1998: 148-159 - T. N. Vijaykumar, Gurindar S. Sohi:
Task Selection for a Multiscalar Processor. MICRO 1998: 81-92 - Chia-Lin Yang, Barton Sano, Alvin R. Lebeck:
Exploiting Instruction Level Parallelism in Geometry Processing for Three Dimensional Graphics Applications. MICRO 1998: 14-24 - Cliff Young, Michael D. Smith:
Better Global Scheduling Using Path Profiles. MICRO 1998: 115-123 - James O. Bondi, Jim Smith:
Proceedings of the 31st Annual IEEE/ACM International Symposium on Microarchitecture, MICRO 31, Dallas, Texas, USA, November 30 - December 2, 1998. ACM/IEEE Computer Society 1998, ISBN 0-8186-8609-X [contents]
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-06 14:58 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