Concurrency and Computation: Practice and Experience

article

Qespera: an adaptive framework for prediction of queue waiting times in supercomputer systems

Prakash Murali, Sathish Vadhiyar

Concurrency and Computation: Practice and Experience > 28 > 9 > 2685 - 2710

Production parallel systems are space‐shared, and resource allocation on such systems is usually performed using a batch queue scheduler. Jobs submitted to the batch queue experience a variable delay before the requested resources are granted. Predicting this delay can assist users in planning experiment time‐frames and choosing sites with less turnaround times and can also help meta‐schedulers make...

article

An adaptive threshold based hybrid load balancing scheme with sender and receiver initiated approach using random information exchange

Taj Alam, Zahid Raza

Concurrency and Computation: Practice and Experience > 28 > 9 > 2729 - 2746

The primary objective of load balancing for distributed systems is to minimize the job execution time while maximizing the resource utilization. Load balancing on decentralized systems need effective information exchange policy so that with minimum amount of communication the nodes have up to date information about other nodes in the system. Periodic, event‐based and on‐demand information exchange...

article

Window‐LRFU: a cache replacement policy subsumes the LRU and window‐LFU policies

Sen Bai, Xin Bai, Xiangjiu Che

Concurrency and Computation: Practice and Experience > 28 > 9 > 2670 - 2684

Replacement algorithms have been widely used as key technologies for cache management in areas such as file systems or database management. A replacement algorithm determines which page to be evicted when the cache is full and a new page is referenced. Because replacement policies considering only recency or frequency such as LRU (Least Recently Used) and LFU (Least Frequently Used) do not perform...

article

Performance evaluation of job schedulers on Hadoop YARN

Jia‐Chun Lin, Ming‐Chang Lee

Concurrency and Computation: Practice and Experience > 28 > 9 > 2711 - 2728

To solve the limitation of Hadoop on scalability, resource sharing, and application support, the open‐source community proposes the next generation of Hadoop's compute platform called Yet Another Resource Negotiator (YARN) by separating resource management functions from the programming model. This separation enables various application types to run on YARN in parallel. To achieve fair resource sharing...

article

Appearance, motion, and embodiment: unpacking avatars by fine‐grained communication analysis

Kazuaki Tanaka, Hideyuki Nakanishi, Hiroshi Ishiguro

Concurrency and Computation: Practice and Experience > 28 > 9 > 2747 - 2747

article

Keystroke dynamics‐based user authentication service for cloud computing

Alshaimaa Abo‐alian, Nagwa L. Badr, M. F. Tolba

Concurrency and Computation: Practice and Experience > 28 > 9 > 2567 - 2585

User authentication is a crucial requirement for cloud service providers to prove that the outsourced data and services are safe from imposters. Keystroke dynamics is a promising behavioral biometrics for strengthening user authentication, however, current keystroke based solutions designed for certain datasets, for example, a fixed length text typed on a traditional personal computer keyboard and...

article

KernelHive: a new workflow‐based framework for multilevel high performance computing using clusters and workstations with CPUs and GPUs

Paweł Rościszewski, Paweł Czarnul, Rafał Lewandowski, Marcel Schally‐Kacprzak

Concurrency and Computation: Practice and Experience > 28 > 9 > 2586 - 2607

The paper presents a new open‐source framework called KernelHive for multilevel parallelization of computations among various clusters, cluster nodes, and finally, among both CPUs and GPUs for a particular application. An application is modeled as an acyclic directed graph with a possibility to run nodes in parallel and automatic expansion of nodes (called node unrolling) depending on the number of...

article

Task‐based FMM for heterogeneous architectures

Emmanuel Agullo, Berenger Bramas, Olivier Coulaud, Eric Darve, more

Concurrency and Computation: Practice and Experience > 28 > 9 > 2608 - 2629

High performance fast multipole method is crucial for the numerical simulation of many physical problems. In a previous study, we have shown that task‐based fast multipole method provides the flexibility required to process a wide spectrum of particle distributions efficiently on multicore architectures. In this paper, we now show how such an approach can be extended to fully exploit heterogeneous...

article

Issue Information

Concurrency and Computation: Practice and Experience > 28 > 9 > 2565 - 2566

No abstract is available for this article.

article

Energy‐efficient scheduling algorithms for batch‐of‐tasks (BoT) applications on heterogeneous computing systems

Mohammad Sajid, Zahid Raza, Mohammad Shahid

Concurrency and Computation: Practice and Experience > 28 > 9 > 2644 - 2669

One of the major design constraints of a heterogeneous computing system is optimal scheduling, that is, mapping of tasks on the processing nodes in order to optimize the QoS parameters. Because of the huge energy consumption by computing resources, negative environmental effects and reduced system reliability, energy has unavoidably been added as a new parameter to the list of QoS parameters. Energy...

article

Social rational secure multi‐party computation

Yilei Wang, Zhe Liu, Hao Wang, Qiuliang Xu

Concurrency and Computation: Practice and Experience > 28 > 9 > 2748 - 2748

article

Special issue Editorial: New technologies of distributed systems

Khalil Drira, Ahmed Hadj Kacem, Mohamed Jmaiel

Concurrency and Computation: Practice and Experience > 28 > 9 > 2749 - 2749

article

VMBackup: an efficient framework for online virtual machine image backup and recovery

Lingfang Zeng, Shijie Xu, Yang Wang

Concurrency and Computation: Practice and Experience > 28 > 9 > 2630 - 2643

Although deduplication can reduce data volume for backup, it pauses the running system for the purpose of data consistency. This problem becomes severe when the target data are Virtual Machine Image (VMI), the volume of which can scale up to several gigabytes. In this paper, we propose an online framework for VM image backup and recovery, called VMBackup, which comprises three major components: (1)...

INFONA - science communication portal

Concurrency and Computation: Practice and Experience

Qespera: an adaptive framework for prediction of queue waiting times in supercomputer systems

An adaptive threshold based hybrid load balancing scheme with sender and receiver initiated approach using random information exchange

Window‐LRFU: a cache replacement policy subsumes the LRU and window‐LFU policies

Performance evaluation of job schedulers on Hadoop YARN

Appearance, motion, and embodiment: unpacking avatars by fine‐grained communication analysis

Keystroke dynamics‐based user authentication service for cloud computing

KernelHive: a new workflow‐based framework for multilevel high performance computing using clusters and workstations with CPUs and GPUs

Task‐based FMM for heterogeneous architectures

Issue Information

Energy‐efficient scheduling algorithms for batch‐of‐tasks (BoT) applications on heterogeneous computing systems

Social rational secure multi‐party computation

Special issue Editorial: New technologies of distributed systems

VMBackup: an efficient framework for online virtual machine image backup and recovery

Filter options

Publication date

Keywords

INFONA - science communication portal

Concurrency and Computation: Practice and Experience

Add recipient

Sending message cancelled

Are you sure you want to cancel sending this message?

Send message

Filter options

Publication date

Date range setting

Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.

Keywords

Reporting an error / abuse

Sending the report failed

Accessibility options