Остановите войну!
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
- 2005
- Michael Behar, Avi Mendelson, Avinoam Kolodny:
Trace Cache Sampling Filter. IEEE PACT 2005: 255-266 - Nathan L. Binkert, Lisa R. Hsu, Ali G. Saidi, Ronald G. Dreslinski, Andrew L. Schultz, Steven K. Reinhardt:
Performance Analysis of System Overheads in TCP/IP Workloads. IEEE PACT 2005: 218-230 - Patrick Carribault, Albert Cohen, William Jalby:
Deep Jam: Conversion of Coarse-Grain Parallelism to Instruction-Level and Vector Parallelism for Irregular Applications. IEEE PACT 2005: 291-302 - Calin Cascaval, Evelyn Duesterwald, Peter F. Sweeney, Robert W. Wisniewski:
Multiple Page Size Modeling and Optimization. IEEE PACT 2005: 339-349 - Wei-Yu Chen, Costin Iancu, Katherine A. Yelick:
Communication Optimizations for Fine-Grained UPC Applications. IEEE PACT 2005: 267-278 - John D. Davis, James Laudon, Kunle Olukotun:
Maximizing CMP Throughput with Mediocre Cores. IEEE PACT 2005: 51-62 - Alexandre E. Eichenberger, Kathryn M. O'Brien, Kevin O'Brien, Peng Wu, Tong Chen, Peter H. Oden, Daniel A. Prener, Janice C. Shepherd, Byoungro So, Zehra Sura, Amy Wang, Tao Zhang, Peng Zhao, Michael Gschwind:
Optimizing Compiler for the CELL Processor. IEEE PACT 2005: 161-172 - Changpeng Fang, Steve Carr, Soner Önder, Zhenlin Wang:
Instruction Based Memory Distance Analysis and its Application. IEEE PACT 2005: 27-37 - Ilya Ganusov, Martin Burtscher:
Future Execution: A Hardware Prefetching Technique for Chip Multiprocessors. IEEE PACT 2005: 350-360 - Enric Gibert, Jaume Abella, F. Jesús Sánchez, Xavier Vera, Antonio González:
Variable-Based Multi-module Data Caches for Clustered VLIW Processors. IEEE PACT 2005: 207-217 - Masayo Haneda, Peter M. W. Knijnenburg, Harry A. G. Wijshoff:
Automatic Selection of Compiler Options Using Non-parametric Inferential Statistics. IEEE PACT 2005: 123-132 - Costin Iancu, Parry Husbands, Paul Hargrove:
HUNTing the Overlap. IEEE PACT 2005: 279-290 - Changhao Jiang, Marc Snir:
Automatic Tuning Matrix Multiplication Performance on Graphics Hardware. IEEE PACT 2005: 185-196 - Timothy M. Jones, Michael F. P. O'Boyle, Jaume Abella, Antonio González, Oguz Ergin:
Compiler Directed Early Register Release. IEEE PACT 2005: 110-122 - Konstantinos Kyriakopoulos, Kleanthis Psarris:
Efficient Techniques for Advanced Data Dependence Analysis. IEEE PACT 2005: 143-156 - Lian Li, Lin Gao, Jingling Xue:
Memory Coloring: A Compiler Approach for Scratchpad Memory Management. IEEE PACT 2005: 329-338 - Gabriel H. Loh:
A Simple Divide-and-Conquer Approach for Neural-Class Branch Prediction. IEEE PACT 2005: 243-254 - Austen McDonald, JaeWoong Chung, Hassan Chafi, Chi Cao Minh, Brian D. Carlstrom, Lance Hammond, Christos Kozyrakis, Kunle Olukotun:
Characterization of TCC on Chip-Multiprocessors. IEEE PACT 2005: 63-74 - Andreas Moshovos, Alexandros Kostopoulos:
Memory State Compressors for Giga-Scale Checkpoint/Restore. IEEE PACT 2005: 303-314 - Hussam Mousa, Chandra Krintz:
HPS: Hybrid Profiling Support. IEEE PACT 2005: 38-50 - Erez Perelman, Trishul M. Chilimbi, Brad Calder:
Variational Path Profiling. IEEE PACT 2005: 7-16 - M. Wasiur Rashid, Edwin J. Tan, Michael C. Huang, David H. Albonesi:
Exploiting Coarse-Grain Verification Parallelism for Power-Efficient Fault Tolerance. IEEE PACT 2005: 315-328 - Justin R. Rattner:
Multi-Core to the Masses. IEEE PACT 2005: 3 - Swarup Kumar Sahoo, Gagan Agrawal:
Data Centric Transformations on Non-Integer Iteration Spaces. IEEE PACT 2005: 133-142 - Yonghong Song, Spiros Kalogeropulos, Partha Tirumalai:
Design and Implementation of a Compiler Framework for Helper Threading on Multi-core Processors. IEEE PACT 2005: 99-109 - Guy L. Steele Jr.:
Parallel Programming and Parallel Abstractions in Fortress. IEEE PACT 2005: 157 - Sriraman Tallam, Rajiv Gupta, Xiangyu Zhang:
Extended Whole Program Paths. IEEE PACT 2005: 17-26 - Thomas F. Wenisch, Stephen Somogyi, Nikolaos Hardavellas, Jangwoo Kim, Chris Gniady, Anastassia Ailamaki, Babak Falsafi:
Store-Ordered Streaming of Shared Memory. IEEE PACT 2005: 75-86 - Ben Wun, Jeremy Buhler, Patrick Crowley:
Exploiting Coarse-Grained Parallelism to Accelerate Protein Motif Finding with a Network Processor. IEEE PACT 2005: 173-184 - Message from the General Chair. IEEE PACT 2005
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-29 13:49 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