FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2072938341> ?p ?o ?g. }

• W2072938341 endingPage "28" @default.
• W2072938341 startingPage "14" @default.
• W2072938341 abstract "We consider here the problem of scheduling tasks each of which is logically decomposed into a mandatory subtask and an optional subtask. The mandatory subtask must be executed to completion in order to produce an acceptable result. The optional subtask begins after the mandatory subtask is completed and refines the result in order to reduce the error in the result. If the available processor time is insufficient, the optional subtask can be left incompleted. The error in the result of a task is equal to the processing time of the unexecuted portion of the optional subtask. We describe a preemptive algorithm for scheduling <i>n</i> dependent tasks with rational ready times, deadlines, and processing times on uniprocessor systems. This algorithm is optimal in the sense that it finds feasible schedules meeting ready-time and deadline constraints of all tasks and minimizing the average error of all tasks, whenever feasible schedules exist. The complexity of this algorithm is <i>O</i>(<i>n</i>²log²<i>n</i>). This algorithm can also be used to schedule optimally independent tasks with rational ready times, deadlines and processing times on identical multiprocessor systems. R<1>@Liu, J. W. S., K. J. Lin, and S. Natarajan, Scheduling real-time, periodic jobs using imprecise results, <i>Proceedings of the IEEE 8th Real-Time Systems Symposium</i>, San Jose, California, December 1987. R<2>Chung, J. Y. and J. W. S. Liu, Performance of algorithms for scheduling periodic jobs to minimize average error, <i>Proceedings of the IEEE 9th Real-Time Systems Symposium</i>, Huntsville, Alabama, December 1988. R<3>Chung, J. Y. and J. W. S. Liu, Performance of algorithms for scheduling periodic jobs to avoid timing faults, to appear in the <i>Proceedings of 22nd Hawaii International Conference on System Sciences</i>, Hawaii, 1989. R<4>Lin, K. J., S. Natarajan, J. W. -S. Liu, and T. Krauskopf, Concord: a system of imprecise computations, <i>Proceedings of the 1987 IEEE Compsac</i>, Japan, October, 1987. R<5>Blazewicz, J. and G. Finke, Minimizing mean weighted execution time loss on identical and uniform processors, <i>Information Processing Letters</i>, Vol. 24, pp. 259--263, March 1987. R<6>Chong, E. K. P. and W. Zhao, <i>Performance evaluation of scheduling algorithms for imprecise computer systems</i>, Technical Report, Department of Computer Science, University of Adelaide, SA 5001, Australia, September 1988. R<7>Chong, E. K. P. and W. Zhao, <i>User controlled optimization in task scheduling for imprecise computer systems</i>, Technical Report, Department of Computer Science, University of Adelaide, SA 5001, Australia, October 1988. R<8>Lawler, E. L. and J. M. Moore, A functional equation and its application to resource allocation and scheduling problem, <i>Management Science</i>, Vol. 16, pp. 77--84, 1969. R<9>McNaughton, R., Scheduling with deadlines and loss functions, <i>Management Science</i>, Vol. 12, pp. 1--12, 1959. R<10>Tarjan, R. E., <i>Data Structures and Network Algorithms</i>, Society for Industrial and Applied Mathematics, Pennsylvania, 1983. R<11>Shih, W. K., J. W. S. Liu, J. Y. Chung, and D. W. Gillies, <i>Scheduling tasks with ready times and deadlines to minimize average error</i>, Technical Report, Department of Computer Science, University of Illinois, January 1989." @default.
• W2072938341 created "2016-06-24" @default.
• W2072938341 creator A5004907722 @default.
• W2072938341 creator A5047897840 @default.
• W2072938341 creator A5051569084 @default.
• W2072938341 creator A5084828101 @default.
• W2072938341 date "1989-07-01" @default.
• W2072938341 modified "2023-10-16" @default.
• W2072938341 title "Scheduling tasks with ready times and deadlines to minimize average error" @default.
• W2072938341 cites W1513400187 @default.
• W2072938341 cites W1549430717 @default.
• W2072938341 cites W1982759900 @default.
• W2072938341 cites W2058817479 @default.
• W2072938341 cites W2097706396 @default.
• W2072938341 cites W3091269150 @default.
• W2072938341 doi "https://doi.org/10.1145/71021.71022" @default.
• W2072938341 hasPublicationYear "1989" @default.
• W2072938341 type Work @default.
• W2072938341 sameAs 2072938341 @default.
• W2072938341 citedByCount "30" @default.
• W2072938341 countsByYear W20729383412012 @default.
• W2072938341 countsByYear W20729383412013 @default.
• W2072938341 countsByYear W20729383412016 @default.
• W2072938341 countsByYear W20729383412017 @default.
• W2072938341 countsByYear W20729383412018 @default.
• W2072938341 countsByYear W20729383412020 @default.
• W2072938341 countsByYear W20729383412023 @default.
• W2072938341 crossrefType "journal-article" @default.
• W2072938341 hasAuthorship W2072938341A5004907722 @default.
• W2072938341 hasAuthorship W2072938341A5047897840 @default.
• W2072938341 hasAuthorship W2072938341A5051569084 @default.
• W2072938341 hasAuthorship W2072938341A5084828101 @default.
• W2072938341 hasBestOaLocation W20729383411 @default.
• W2072938341 hasConcept C111919701 @default.
• W2072938341 hasConcept C11413529 @default.
• W2072938341 hasConcept C126255220 @default.
• W2072938341 hasConcept C173608175 @default.
• W2072938341 hasConcept C206729178 @default.
• W2072938341 hasConcept C33923547 @default.
• W2072938341 hasConcept C41008148 @default.
• W2072938341 hasConcept C4822641 @default.
• W2072938341 hasConcept C68387754 @default.
• W2072938341 hasConcept C79189994 @default.
• W2072938341 hasConcept C94375191 @default.
• W2072938341 hasConceptScore W2072938341C111919701 @default.
• W2072938341 hasConceptScore W2072938341C11413529 @default.
• W2072938341 hasConceptScore W2072938341C126255220 @default.
• W2072938341 hasConceptScore W2072938341C173608175 @default.
• W2072938341 hasConceptScore W2072938341C206729178 @default.
• W2072938341 hasConceptScore W2072938341C33923547 @default.
• W2072938341 hasConceptScore W2072938341C41008148 @default.
• W2072938341 hasConceptScore W2072938341C4822641 @default.
• W2072938341 hasConceptScore W2072938341C68387754 @default.
• W2072938341 hasConceptScore W2072938341C79189994 @default.
• W2072938341 hasConceptScore W2072938341C94375191 @default.
• W2072938341 hasIssue "3" @default.
• W2072938341 hasLocation W20729383411 @default.
• W2072938341 hasOpenAccess W2072938341 @default.
• W2072938341 hasPrimaryLocation W20729383411 @default.
• W2072938341 hasRelatedWork W1517776641 @default.
• W2072938341 hasRelatedWork W1546966627 @default.
• W2072938341 hasRelatedWork W1867962035 @default.
• W2072938341 hasRelatedWork W1977787112 @default.
• W2072938341 hasRelatedWork W1999531921 @default.
• W2072938341 hasRelatedWork W2123315201 @default.
• W2072938341 hasRelatedWork W2133768306 @default.
• W2072938341 hasRelatedWork W2170596605 @default.
• W2072938341 hasRelatedWork W99192079 @default.
• W2072938341 hasRelatedWork W2105876736 @default.
• W2072938341 hasVolume "23" @default.
• W2072938341 isParatext "false" @default.
• W2072938341 isRetracted "false" @default.
• W2072938341 magId "2072938341" @default.
• W2072938341 workType "article" @default.