TY - GEN
T1 - Usage history-based architectural scheduling
AU - Kim, Dongsun
AU - Kim, Seokhwan
AU - Park, Sooyong
PY - 2009
Y1 - 2009
N2 - Waiting a long time for software applications to load typically elicits an adverse response from the user. This negative response eventually leads to decreased user sat- isfaction. The waiting time can be reduced by executing the application in improved hardware computing devices and by optimizing the algorithms constituting the application; however, these solutions are costly. An alternative approach is to overlap the execution and waiting times. Although this approach does not reduce the actual waiting time, it can reduce the user's waiting time. This study proposes an ap- proach to decrease the waiting time by scheduling archi- tectural units. The study formulates the dynamic architec- tural scheduling problem and it provides an overlapping ap- proach to the problem on the basis of the formulation. This approach anticipates subsequent tasks from previous usage history and launches the corresponding components of the anticipated tasks in the task architectures. Evaluation of this approach shows that it effectively schedules applica- tions and reduces waiting time.
AB - Waiting a long time for software applications to load typically elicits an adverse response from the user. This negative response eventually leads to decreased user sat- isfaction. The waiting time can be reduced by executing the application in improved hardware computing devices and by optimizing the algorithms constituting the application; however, these solutions are costly. An alternative approach is to overlap the execution and waiting times. Although this approach does not reduce the actual waiting time, it can reduce the user's waiting time. This study proposes an ap- proach to decrease the waiting time by scheduling archi- tectural units. The study formulates the dynamic architec- tural scheduling problem and it provides an overlapping ap- proach to the problem on the basis of the formulation. This approach anticipates subsequent tasks from previous usage history and launches the corresponding components of the anticipated tasks in the task architectures. Evaluation of this approach shows that it effectively schedules applica- tions and reduces waiting time.
UR - http://www.scopus.com/inward/record.url?scp=70449657438&partnerID=8YFLogxK
U2 - 10.1109/COMPSAC.2009.65
DO - 10.1109/COMPSAC.2009.65
M3 - Conference contribution
AN - SCOPUS:70449657438
SN - 9780769537269
T3 - Proceedings - International Computer Software and Applications Conference
SP - 443
EP - 451
BT - Proceedings - 2009 33rd Annual IEEE International Computer Software and Applications Conference, COMPSAC 2009
T2 - 2009 33rd Annual IEEE International Computer Software and Applications Conference, COMPSAC 2009
Y2 - 20 July 2009 through 24 July 2009
ER -