default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParallel Processing Letters, Volume 17, 2007
Volume 17, Number 1, March 2007
- Andrew Lumsdaine
, Douglas P. Gregor, Bruce Hendrickson, Jonathan W. Berry:
Challenges in Parallel Graph Processing. 5-20 - John Brevik, Daniel Nurmi, Richard Wolski:
Using Model-Based Clustering to Improve Predictions for Queueing Delay on Parallel Machines. 21-46 - Emmanuel Jeannot, Keith Seymour, Asim YarKhan, Jack J. Dongarra:
Improved Runtime and Transfer Time Prediction Mechanisms in a Network Enabled Servers Middleware. 47-59 - Loris Marchal, Veronika Rehn, Yves Robert, Frédéric Vivien:
Scheduling Algorithms for Data Redistribution and Load-Balancing on Master-Slave Platforms. 61-77 - Richard L. Graham, Brian Barrett, Galen M. Shipman, Timothy S. Woodall, George Bosilca:
Open MPI: a High Performance, Flexible Implementation of MPI Point-to-Point Communications. 79-88 - Ewing L. Lusk, Katherine A. Yelick:
Languages for High-Productivity Computing: the DARPA HPCS Language Project. 89-102 - James S. Plank, Michael G. Thomason:
An Exploration of Non-asymptotic Low-Density, Parity Check Erasure Codes for Wide-Area Storage Applications. 103-123
Volume 17, Number 2, June 2007
- A. Márquez, Consolación Gil, Raul Baños, Julio Gómez:
Improving the Performance of Multi-Objective Evolutionary Algorithms Using the Island Parallel Model. 127-139 - Leonid Khachiyan, Endre Boros, Vladimir Gurvich, Khaled M. Elbassioni:
Computing Many Maximal Independent Sets for Hypergraphs in Parallel. 141-152 - Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman:
Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency. 153-168 - David Coudert, Pallab Datta, Stephane Perennes, Hervé Rivano, Marie-Emilie Voge:
Shared Risk Resource Group Complexity and Approximability Issues. 169-184 - Naya Nagy, Selim G. Akl:
Aspects of Biomolecular Computing. 185-211 - Ahmad Khonsari, Alireza Shahrabi, Mohamed Ould-Khaoua:
A Performance Model of Disha Routing in k-Ary n-Cube Networks. 213-228
Volume 17, Number 3, September 2007
- Marius Nagy, Selim G. Akl:
Parallelism in Quantum Information Processing Defeats the Universal Computer. 233-262 - Shafagh Jafer, Gabriel A. Wainer:
Parallel Algorithms for Cellular Models Simulation. 263-285 - Heiko Hamann, Heinz Wörn:
Embodied Computation. 287-298 - Grzegorz Drzadzewski, Mark Wineberg:
Comparing Minimum Neighborhood Evaluation Schemes for Finding Spatially Robust Solutions. 299-309 - Grzegorz Drzadzewski, Mark Wineberg:
How Solution Density Affects the Finding of Spatially Robust Solutions. 311-321 - Naya Nagy, Selim G. Akl:
Authenticated Quantum Key Distribution without Classical Communication. 323-335
Volume 17, Number 4, December 2007
- Tom Head:
Photocomputing: Explorations with Transparency and Opacity. 339-347 - Santiago García Carbajal:
Parallelizing Three Dimensional Cellular Automata with OPenMP. 349-361 - Eric Gamess:
An Architectural Approach to Building Grids Using Legacy Code. 363-378 - Sandeep S. Kulkarni:
Terminating alternator. 379-390 - Kyriakos Neocleous, Marios D. Dikaiakos, Paraskevi Fragopoulou, Evangelos P. Markatos:
Failure Management in Grids: the Case of the EGEE Infrastructure. 391-410 - Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit:
A Lazy Concurrent List-Based Set Algorithm. 411-424 - Ke Qiu:
On a Unified Neighbourhood Broadcasting Scheme for Interconnection Networks. 425-437 - Fangpeng Dong:
A Taxonomy of Task Scheduling Algorithms in the Grid. 439-454 - Andrew Adamatzky:
Physarum Machine: Implementation of a Kolmogorov-Uspensky Machine on a Biological substrate. 455-467
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.
last updated on 2025-12-09 23:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
