Abstract | ||
---|---|---|
In this paper we consider the performance of different scheduling policies in a smart environment. Models are generated under a hospital scenario, and are used to simulate patient flow under three scheduling policies. SimJava 2.0 is adopted as the main simulator in this work. The findings generally show that the dynamic scheduling policy has better performance than the static scheduling policy. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1109/CyberC.2011.99 | CyberC |
Keywords | Field | DocType |
scheduling,dynamic scheduling policy,hospitals,hospital scenario,software performance evaluation,smart hospital environment,patient flow,better performance,scheduling policy,different scheduling policy,simjava 2.0,performance evaluation,scheduling policies,smart environment,static scheduling policy,java,main simulator,dynamic scheduling,discrete event simulation,computational modeling,length measurement | Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Flow shop scheduling,Real-time computing,Scheduling (production processes),Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Round-robin scheduling | Conference |
ISBN | Citations | PageRank |
978-1-4577-1827-4 | 1 | 0.35 |
References | Authors | |
5 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Xiao Chen | 1 | 11 | 2.34 |
Nigel Thomas | 2 | 211 | 29.47 |
Michael D. Harrison | 3 | 1004 | 115.78 |