Остановите войну!
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 23 matches
- 2003
- Kubilay Atasu, Laura Pozzi, Paolo Ienne:
Automatic Application-Specific Instruction-Set Extensions Under Microarchitectural Constraints. Int. J. Parallel Program. 31(6): 411-428 (2003) - José L. Ayala, Alexander V. Veidenbaum, Marisa Luisa López-Vallejo:
Power-Aware Compilation for Register File Energy Reduction. Int. J. Parallel Program. 31(6): 451-467 (2003) - Siegfried Benkner, Viera Sipková:
Exploiting Distributed-Memory and Shared-Memory Parallelism on Clusters of SMPs with Data Parallel Programs. Int. J. Parallel Program. 31(1): 3-19 (2003) - Patricio Bulic, Veselko Gustin:
An Extended ANSI C for Processors with a Multimedia Extension. Int. J. Parallel Program. 31(2): 107-136 (2003) - Nathan Clark, Hongtao Zhong, Wilkin Tang, Scott A. Mahlke:
Automatic Design of Application Specific Instruction Set Extensions Through Dataflow Graph Exploration. Int. J. Parallel Program. 31(6): 429-449 (2003) - Alfredo Cristóbal-Salas, Andrei Tchernykh, Jean-Luc Gaudiot, Wen-Yen Lin:
Non-Strict Execution in Parallel and Distributed Computing. Int. J. Parallel Program. 31(2): 77-105 (2003) - J. Davison de St. Germain, Alan Morris, Steven G. Parker, Allen D. Malony, Sameer Shende:
Performance Analysis Integration in the Uintah Software Development Cycle. Int. J. Parallel Program. 31(1): 35-53 (2003) - Richard L. Graham, Sung-Eun Choi, David J. Daniel, Nehal N. Desai, Ronald G. Minnich, Craig Edward Rasmussen, L. Dean Risinger, Mitchel W. Sukalski:
A Network-Failure-Tolerant Message-Passing System for Terascale Clusters. Int. J. Parallel Program. 31(4): 285-303 (2003) - Takeshi Iwashita, Masaaki Shimasaki:
Block Red-Black Ordering: A New Ordering Strategy for Parallelization of ICCG Method. Int. J. Parallel Program. 31(1): 55-75 (2003) - Minsoo Jeon, Dongseung Kim:
Parallel Merge Sort with Load Balancing. Int. J. Parallel Program. 31(1): 21-33 (2003) - Kazuki Joe:
Guest Editor's Introduction. Int. J. Parallel Program. 31(1): 1-2 (2003) - Christopher Kachris, Nikolaos G. Bourbakis, Apostolos Dollas:
A Reconfigurable Logic-Based Processor for the SCAN Image and Video Encryption Algorithm. Int. J. Parallel Program. 31(6): 489-506 (2003) - Keqin Li:
On the Performance of Randomized Embedding of Reproduction Trees in Static Networks. Int. J. Parallel Program. 31(5): 393-406 (2003) - Zhijian Lu, John C. Lach, Mircea R. Stan, Kevin Skadron:
Alloyed Branch History: Combining Global and Local Branch History for Robust Performance. Int. J. Parallel Program. 31(2): 137-177 (2003) - Seung-Jai Min, Ayon Basumallik, Rudolf Eigenmann:
Optimizing OpenMP Programs on Software Distributed Shared Memory Systems. Int. J. Parallel Program. 31(3): 225-249 (2003) - Hirofumi Nakano, Kazuhisa Ishizaka, Motoki Obata, Keiji Kimura, Hironori Kasahara:
Static Coarse Grain Task Scheduling with Cache Optimization Using OpenMP. Int. J. Parallel Program. 31(3): 211-223 (2003) - Alex Orailoglu:
Guest Editor's Introduction. Int. J. Parallel Program. 31(6): 407-409 (2003) - Venkata K. Pingali, Sally A. McKee, Wilson C. Hsieh, John B. Carter:
Restructuring Computations for Temporal Data Cache Locality. Int. J. Parallel Program. 31(4): 305-338 (2003) - Silvius Vasile Rus, Lawrence Rauchwerger, Jay P. Hoeflinger:
Hybrid Analysis: Static & Dynamic Memory Reference Analysis. Int. J. Parallel Program. 31(4): 251-283 (2003) - Hideki Saito, Greg Gaertner, Wesley B. Jones, Rudolf Eigenmann, Hidetoshi Iwashita, Ron Lieberman, G. Matthijs van Waveren, Brian Whitney:
Large System Performance of SPEC OMP Benchmark Suites. Int. J. Parallel Program. 31(3): 197-209 (2003) - G. Surendra, Subhasis Banerjee, S. K. Nandy:
On the Effectiveness of Flow Aggregation in Improving Instruction Reuse in Network Processing Applications. Int. J. Parallel Program. 31(6): 469-487 (2003) - Daisuke Takahashi, Mitsuhisa Sato, Taisuke Boku:
Performance Evaluation of the Hitachi SR8000 Using SPEC OMP2001 Benchmarks. Int. J. Parallel Program. 31(3): 185-196 (2003) - Han-Saem Yun, Jihong Kim, Soo-Mook Moon:
Time Optimal Software Pipelining of Loops with Control Flows. Int. J. Parallel Program. 31(5): 339-391 (2003)
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-04-25 17:08 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