Name
Abstract | ||
|---|---|---|
The paper presents new Java programs scheduling algorithms for execution on clusters of Java Virtual Machines (JVMs), which involve extremal optimization (EO) combined with task clustering. Two new scheduling algorithms are presented and compared. The first employs task clustering to reduce an initial program graph and then applies extremal optimization to schedule the reduced program graph to system resources. The second algorithm applies task clustering only to find an initial solution which is next improved by the EO algorithm working on the initial program graph. Both algorithms are also compared to an EO algorithm which does not use the clustering approach. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-20520-0_7 | EvoApplications (2) |
Keywords | Field | DocType |
eo algorithm,task scheduling,clustering approach,java virtual machines,new java program,extremal optimization,initial solution,new scheduling algorithm,reduced program graph,initial program graph,task clustering,distributed systems,evolutionary algorithm,scheduling algorithm,scheduling,distributed system,evolutionary algorithms | Evolutionary algorithm,Extremal optimization,Fair-share scheduling,Scheduling (computing),Computer science,Parallel computing,Rate-monotonic scheduling,Dynamic priority scheduling,Cluster analysis,Java,Distributed computing | Conference |
Volume | ISSN | Citations |
6625 | 0302-9743 | 3 |
PageRank | References | Authors |
0.43 | 9 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eryk Laskowski | 1 | 107 | 18.85 |
| Marek Tudruj | 2 | 271 | 56.00 |
| Ivanoe De Falco | 3 | 242 | 34.58 |
| Umberto Scafuri | 4 | 116 | 16.33 |
| Ernesto Tarantino | 5 | 361 | 42.45 |
| Richard Olejnik | 6 | 59 | 5.80 |