Skip to main content
select distinct n.content as name, r.content as role, t.nameID as nameID, n.unitID as unitID, n.departmentID as departmentID, n.facultyID as facultyID, n.provinceID as provinceID, n.countryID as countryID from transaction as t, Name as n, Role as r where t.itemID='105706' and t.nameID=n.id and t.roleID=r.id
scopus



Dynamic user-level CPU allocation for Volunteer computing in CFS-based scheduler environment

Researcher

เครือข่ายคณะผู้วิจัย


เครือข่ายนักวิจัย+ผลงานวิจัย (full screen)

Abstract

In this paper, we propose a CPU allocation technique to solve the problem of running volunteer application on a system with Completely Fair Scheduler (CFS) using Adaptive Reservation. Our allocation technique works across user boundary without requiring administrative privilege. We implemented and evaluated our technique on Linux-based system with the CFS. Our technique could mitigate Performance loss of foreground workload. In compute-heavy test and Video Playback test, Performance loss is negligible. While in latency sensitive web server test, Performance loss is only about 10 percent. Our technique also improves background workload performance up to 50 percent comparing to traditional static allocation method. © 2015 IEEE.

Completely Fair Scheduler (1 items found) | Adaptive Reservation (1 items found) | Linux-based system (1 items found) | Performance loss (5 items found) | Video Playback (4 items found) | CFS (6 items found) | Volunteer ComputingArtificial intelligence | Distributed computer systems | Computer operating systems | Software engineering | Volunteer computing | Allocation methods | User levels | Scheduling |

ต้นฉบับข้อมูล : scopus