|Affiliation||Computer Science, Information Technology|
|Profile||My specialty is scheduling algorithm on real time system. The goal of real-time scheduling algorithms is to meet all tasks’ deadlines, in other words, to keep the feasibility of scheduling through admission control. Traditionally, the performance criteria of algorithm for task scheduling problem are throughput, utilization of processors, waiting time of tasks, etc. In real-time system, the performance of scheduling algorithm is measured by its ability to generate a feasible schedule for a set of real-time tasks. This problem is, in almost all practical cases, an NP-hard problem. Consequently various modern heuristics based algorithms have been proposed for practical reason.
I am interested in research on the traditional method and the heuristic method for scheduling algorithm on real time system to minimize total deadline miss. Research results are clarified through presentations at international conferences and publications in journals.
|Research Field(Keyword & Summary)||
|Grant-in-Aid for Scientific Research Support: Japan Society for Promotion of Science (JSPS)||https://nrid.nii.ac.jp/en/nrid/1000080451384/|
|Recruitment of research assistant(s)||No|
|Affiliated academic society (Membership type)||(1) IEEE (Associate Member)
(2) IPSJ (regular member)
(3) IEICE (regular member)
|Education Field (Undergraduate level)||Operating System, Optimization Problem|
|Education Field (Graduate level)||Real time system, Scheduling Algorithm, Heuristic Algorithm|