Usage History-based Architectural Scheduling

초록

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 satisfaction. 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 approach to decrease the waiting time by scheduling architectural units. The study formulates the dynamic architectural scheduling problem and it provides an overlapping approach 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 applications and reduces waiting time.

키워드