Abstract | ||
---|---|---|
Many large-scale distributed computing applications demand real-time responses by soft deadlines. To enable such real-time task distribution and execution on the volunteer resources, we previously proposed the design of the real-time volunteer computing platform called RT-BOINC. The system gives low O(1) worst-case execution time for task management operations, such as task scheduling, state transitioning, and validation. In this work, we present a full implementation RT-BOINC, adding new features including deadline timer and parameter-based admission control. We evaluate RT-BOINC at large scale using two real-time applications, namely, the games Go and Chess. The results of our case study show that RT-BOINC provides much better performance than the original BOINC in terms of average and worst-case response time, scalability and efficiency. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1109/CCGrid.2011.54 | CCGrid |
Keywords | Field | DocType |
parameter based admission control,large scale distributed computing,real-time response,grid computing,worst-case response time,task management,real-time volunteer computing platform,worst-case execution time,real time task distribution,better performance,task management operation,real-time task distribution,volunteer resource,volunteer distributed computing,towards real-time,real-time application,task scheduling,rt-boinc,games,distributed computing,real time,worst case execution time,servers,data structures,real time systems,state transition,databases | Grid computing,Task management,Worst-case execution time,Admission control,Scheduling (computing),Computer science,Timer,BOINC Credit System,Distributed computing,Scalability | Conference |
ISBN | Citations | PageRank |
978-0-7695-4395-6 | 11 | 1.02 |
References | Authors | |
7 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sangho Yi | 1 | 538 | 35.84 |
Emmanuel Jeannot | 2 | 909 | 61.76 |
Derrick Kondo | 3 | 1541 | 82.99 |
David P. Anderson | 4 | 2698 | 330.88 |