Name
Abstract | ||
|---|---|---|
This paper focuses on the problem of scheduling outages to computer systems in complex distributed environments. The interconnected nature of these systems makes scheduling global change very difficult and time consuming, with a high degree of error. In addressing this problem, we describe the constraints on successful outage scheduling. Using these constraints, it describes a solution using Constraint Logic Programming, which is able to deliver rapid schedules for complex architectures. The developed approach is then applied and tested to several real world problems to ascertain its effectiveness and performance. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-39425-9_35 | ADVANCED PARALLEL PROCESSING TECHNOLOGIES, PROCEEDINGS |
Keywords | Field | DocType |
distributed environment,global change | Fair-share scheduling,Computer science,Scheduling (computing),Scheduling (production processes),Two-level scheduling,Nurse scheduling problem,Schedule,Dynamic priority scheduling,Round-robin scheduling,Distributed computing | Conference |
Volume | ISSN | Citations |
2834 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anthony Butler | 1 | 9 | 2.29 |
| Hema Sharda | 2 | 44 | 4.76 |
| David Taniar | 3 | 1890 | 189.50 |