![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
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 1,477 matches
- 2024
- Alif Ahmed, Farzana Ahmed Siddique, Kevin Skadron:
GraphTango: A Hybrid Representation Format for Efficient Streaming Graph Updates and Analysis. Int. J. Parallel Program. 52(3): 147-170 (2024) - Christian Heidorn, Muhammad Sabih
, Nicolai Meyerhöfer, Christian Schinabeck
, Jürgen Teich
, Frank Hannig
:
Hardware-Aware Evolutionary Explainable Filter Pruning for Convolutional Neural Networks. Int. J. Parallel Program. 52(1-2): 40-58 (2024) - Fabian Knorr, Philip Salzmann, Peter Thoman, Thomas Fahringer:
Automatic Discovery of Collective Communication Patterns in Parallelized Task Graphs. Int. J. Parallel Program. 52(3): 171-186 (2024) - Milad Kokhazadeh, Georgios Keramidas, Vasilios I. Kelefouras, Iakovos Stamoulis:
A Practical Approach for Employing Tensor Train Decomposition in Edge Devices. Int. J. Parallel Program. 52(1-2): 20-39 (2024) - Pedro Moreno, Miguel Areias, Ricardo Rocha, Vítor Santos Costa:
Yet Another Lock-Free Atom Table Design for Scalable Symbol Management in Prolog. Int. J. Parallel Program. 52(3): 187-206 (2024) - Luise Müller
, Philipp Wanko, Christian Haubelt, Torsten Schaub:
Investigating Methods for ASPmT-Based Design Space Exploration in Evolutionary Product Design. Int. J. Parallel Program. 52(1-2): 59-92 (2024) - Alex Orailoglu, Marc Reichenbach, Matthias Jung:
Special Issue on SAMOS 2022. Int. J. Parallel Program. 52(1-2): 1-2 (2024) - Alessandro Ottaviano, Robert Balas, Giovanni Bambini
, Antonio del Vecchio, Maicol Ciani, Davide Rossi, Luca Benini, Andrea Bartolini:
ControlPULP: A RISC-V On-Chip Parallel Power Controller for Many-Core HPC Processors with FPGA-Based Hardware-In-The-Loop Power and Thermal Emulation. Int. J. Parallel Program. 52(1-2): 93-123 (2024) - Viktor Razilov, Robert Wittig, Emil Matús, Gerhard P. Fettweis:
Access Interval Prediction by Partial Matching for Tightly Coupled Memory Systems. Int. J. Parallel Program. 52(1-2): 3-19 (2024) - Nicolò Tonci, Sébastien Rivault, Mostafa Bamha, Sophie Robert, Sébastien Limet, Massimo Torquati:
LSH SimilarityJoin Pattern in FastFlow. Int. J. Parallel Program. 52(3): 207-230 (2024) - Yingpeng Wen, Zhilin Qiu, Dongyu Zhang, Dan Huang, Nong Xiao, Liang Lin:
Accelerating Massively Distributed Deep Learning Through Efficient Pseudo-Synchronous Update Method. Int. J. Parallel Program. 52(3): 125-146 (2024) - 2023
- Retraction Note: Designing a Framework for Communal Software: Based on the Assessment Using Relation Modelling. Int. J. Parallel Program. 51(1): 107 (2023)
- Vsevolod Bohaienko
:
Calculation of Distributed-Order Fractional Derivative on Tensor Cores-Enabled GPU. Int. J. Parallel Program. 51(4-5): 256-270 (2023) - August Ernstsson
, Dalvan Griebler
, Christoph W. Kessler
:
Assessing Application Efficiency and Performance Portability in Single-Source Programming for Heterogeneous Parallel Systems. Int. J. Parallel Program. 51(1): 61-82 (2023) - Yacine Hakimi, Riyadh Baghdadi, Yacine Challal:
A Hybrid Machine Learning Model for Code Optimization. Int. J. Parallel Program. 51(6): 309-331 (2023) - Nina Herrmann, Herbert Kuchen:
Distributed Calculations with Algorithmic Skeletons for Heterogeneous Computing Environments. Int. J. Parallel Program. 51(2-3): 172-185 (2023) - Fabian Knorr, Peter Thoman, Thomas Fahringer:
Declarative Data Flow in a Graph-Based Distributed Memory Runtime System. Int. J. Parallel Program. 51(2-3): 150-171 (2023) - Ruairidh MacGregor, Blair Archibald, Phil Trinder:
Generic Exact Combinatorial Search at HPC Scale. Int. J. Parallel Program. 51(1): 83-106 (2023) - Grace Nansamba, Amani Altarawneh, Anthony Skjellum:
A Fault-Model-Relevant Classification of Consensus Mechanisms for MPI and HPC. Int. J. Parallel Program. 51(2-3): 128-149 (2023) - Virginia Niculescu, Frédéric Loulergue
:
Guest Editor's Note: High-Level Parallel Programming 2021. Int. J. Parallel Program. 51(4-5): 271-273 (2023) - Matthew R. Norman
, Isaac Lyngaas
, Abhishek Bagusetty, Mark A. Berrill:
Portable C++ Code that can Look and Feel Like Fortran Code with Yet Another Kernel Launcher (YAKL). Int. J. Parallel Program. 51(4-5): 209-230 (2023) - Daniel Presser, Frank Siqueira:
Partitioning-Aware Performance Modeling of Distributed Graph Processing Tasks. Int. J. Parallel Program. 51(4-5): 231-255 (2023) - Rui António Sabino Castiço da Silva, João L. Sobral
:
Efficient High-Level Programming in Plain Java. Int. J. Parallel Program. 51(1): 22-42 (2023) - Loïc Sylvestre
, Emmanuel Chailloux
, Jocelyn Sérot:
Accelerating OCaml Programs on FPGA. Int. J. Parallel Program. 51(2-3): 186-207 (2023) - Stephen Timcheck, Jeremy Buhler
:
Interruptible Nodes: Reducing Queueing Costs in Irregular Streaming Dataflow Applications on Wide-SIMD Architectures. Int. J. Parallel Program. 51(1): 43-60 (2023) - Nicolò Tonci, Massimo Torquati, Gabriele Mencagli, Marco Danelutto:
Distributed-Memory FastFlow Building Blocks. Int. J. Parallel Program. 51(1): 1-21 (2023) - Polychronis Velentzas, Michael Vassilakopoulos, Antonio Corral, Christos Antonopoulos:
GPU-Based Algorithms for Processing the k Nearest-Neighbor Query on Spatial Data Using Partitioning and Concurrent Kernel Execution. Int. J. Parallel Program. 51(6): 275-308 (2023) - Haoran Wang, Thibaut Tachon, Chong Li, Sophie Robert, Sébastien Limet:
SMSG: Profiling-Free Parallelism Modeling for Distributed Training of DNN. Int. J. Parallel Program. 51(2-3): 109-127 (2023) - 2022
- Minyu Cui
, Angeliki Kritikakou, Lei Mo
, Emmanuel Casseau:
Energy-Efficient Partial-Duplication Task Mapping Under Multiple DVFS Schemes. Int. J. Parallel Program. 50(2): 267-294 (2022) - Hemalatha Eedi
, Sahith Karra, Sathya Peri, Neha Ranabothu, Rahul Utkoor:
An Improved/Optimized Practical Non-Blocking PageRank Algorithm for Massive Graphs. Int. J. Parallel Program. 50(3-4): 381-404 (2022)
skipping 1,447 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.org/img/cog.dark.24x24.png)
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-07-28 14:19 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