2026-09-21T05:56:01Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/20723 2023-07-10 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Liu, Jane W.S. Bettati, Riccardo 2011-05-07T12:47:27Z 2011-05-07T12:47:27Z 10000-01-01 1994 In a distributed real-time system or communication network, tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as end-to-end release times and deadlines. This thesis describes algorithms to schedule a class of systems where all the tasks execute on different processors in turn in the same order. This end-to-end scheduling problem is known as the flow-shop problem. We present several cases where the problem is tractable and evaluate two heuristic algorithms for the NP-hard general case. We generalize the traditional flow-shop model in two directions. First, we present two algorithms for scheduling flow shops where tasks can be serviced more than once by some processors. Second, we describe a technique to schedule flow shops that consist of periodic tasks and to analyze their schedulability. We generalize this technique and describe how it can be used to schedule distributed systems that can not be modeled by flow shops. We then describe how to combine local or global resource access protocols and end-to-end scheduling. Finally, we show that by using end-to-end scheduling we can simplify resource access protocols and thus increase the utilization of resources. Made available in DSpace on 2011-05-07T12:47:27Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9503139.pdf: 6333315 bytes, checksum: 9da9e71876bac0ce6e308c6b4669f512 (MD5) Previous issue date: 1994 Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:45:50Z Item is restricted indefinitely. Restriction data tranferred 2014-07-01T11:20:22-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission ETDs are only available to UIUC Users without author permission U of I Only AAI9503139 (UMI)AAI9503139 http://hdl.handle.net/2142/20723 eng Copyright 1994 Bettati, Riccardo Computer Science End-to-end scheduling to meet deadlines in distributed systems text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.