登入選單
返回Google圖書搜尋
出版Department of Computer Science, University of Illinois at Urbana-Champaign, 1991
URLhttp://books.google.com.hk/books?id=48eiG6XoiLIC&hl=&source=gbs_api
註釋Abstract: "In this paper, we study the scheduling issues for real-time computations with extended deadlines. Although many jobs are defined with only one deadline, some real-time job allows part of its computation to be finished after the primary deadline but before an extended deadline. In our study, we use a scheduling model similar to that of imprecise computations. The hard part of an imprecise computation must be completed before the computation's primary deadline, but its soft part only needs to be finished before the extended deadline. We study several versions of this problem including to impose a penalty for each late soft part, and to require some overhead for each late soft part."