


Остановите войну!
for scientists:


default search action
Journal of Parallel and Distributed Computing, Volume 87
Volume 87, January 2016
- Viktor K. Prasanna:
Message from the Editor-in-Chief. iii
- Hagit Attiya
, Ami Paz
:
Counting-based impossibility proofs for set agreement and renaming. 1-12 - Ivo Anjo, João P. Cachopo:
Design of a Method-Level Speculation framework for boosting irregular JVM applications. 13-25 - Borzoo Bonakdarpour, Stéphane Devismes
, Franck Petit
:
Snap-stabilizing committee coordination. 26-42 - Shinan Wang, Bing Luo, Weisong Shi
, Devesh Tiwari:
Application configuration selection for energy-efficient execution on multicore systems. 43-54 - Rajesh Sudarsan
, Calvin J. Ribbens:
Combining performance and priority for scheduling resizable parallel applications. 55-66 - Bogdan Nicolae
, Andrzej Kochut, Alexei A. Karve:
Towards scalable on-demand collective data access in IaaS clouds: An adaptive collaborative content exchange proposal. 67-79 - Saima Gulzar Ahmad, Chee Sun Liew
, Ehsan Ullah Munir
, Tan Fong Ang
, Samee U. Khan
:
A hybrid genetic algorithm for optimization of scheduling workflow applications in heterogeneous computing systems. 80-90 - Ashraf Yaseen, Hao Ji
, Yaohang Li:
A load-balancing workload distribution scheme for three-body interaction computation on Graphics Processing Units (GPU). 91-101 - Andrew V. Terekhov
:
A highly scalable parallel algorithm for solving Toeplitz tridiagonal systems of linear equations. 102-108 - Eleni C. Akrida
, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
Ephemeral networks with random availability of links: The case of fast networks. 109-120 - François Siewe
:
Towards the modelling of secure pervasive computing systems: A paradigm of Context-Aware Secure Action System. 121-144

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.