TY - GEN
T1 - A Task Migration Scheme for High Performance Real-Time Cluster System
AU - Suzuki, Makoto
AU - Kobayashi, Hidenori
AU - Yamasaki, Nobuyuki
AU - Anzai, Yuichiro
N1 - Funding Information:
This study was performed through Special Coordination Funds of the Ministry of Education, Culture, Sports, Science and Technology of the Japanese Government.
Publisher Copyright:
© 18th International Conference on Computers and Their Applications 2003, CATA 2003. All rights reserved.
PY - 2003
Y1 - 2003
N2 - In a real-time system, it is attractive to use cluster computing system for realizing high performance and high availability. The objectives of the real-time clusters are maximize guarantee ratio and/or minimize the probability of failure to complete task in time. Because task arrivals are usually uneven among the nodes, some nodes may get temporarily overloaded while others are left underloaded or idle, which leads low performance for real-time clusters. Hence, we need a effective load sharing scheme. In this paper, we describe task migration scheme for real-time cluster environment. Our system uses a single address space architecture because of high predictability. Hence, we have adopted Position Independent Code(PIC) to realize task migration. In our scheme, we introduce "migration type", which decides how to migrate a task by timing constraints of task, communication and whether first allocation or not. Using this scheme, any kind of real-time/non real-time task could be transferred without a crisis of deadline miss.
AB - In a real-time system, it is attractive to use cluster computing system for realizing high performance and high availability. The objectives of the real-time clusters are maximize guarantee ratio and/or minimize the probability of failure to complete task in time. Because task arrivals are usually uneven among the nodes, some nodes may get temporarily overloaded while others are left underloaded or idle, which leads low performance for real-time clusters. Hence, we need a effective load sharing scheme. In this paper, we describe task migration scheme for real-time cluster environment. Our system uses a single address space architecture because of high predictability. Hence, we have adopted Position Independent Code(PIC) to realize task migration. In our scheme, we introduce "migration type", which decides how to migrate a task by timing constraints of task, communication and whether first allocation or not. Using this scheme, any kind of real-time/non real-time task could be transferred without a crisis of deadline miss.
UR - http://www.scopus.com/inward/record.url?scp=84944917972&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84944917972&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84944917972
T3 - 18th International Conference on Computers and Their Applications 2003, CATA 2003
SP - 228
EP - 231
BT - 18th International Conference on Computers and Their Applications 2003, CATA 2003
A2 - Debnath, Narayan C.
PB - The International Society for Computers and Their Applications (ISCA)
T2 - 18th International Conference on Computers and Their Applications, CATA 2003
Y2 - 26 March 2003 through 28 March 2003
ER -