Evaluates the tradeoffs involved in the design of next generationhard real-time systems, using fast packet switching technology. Theauthors propose to use simple local scheduling algorithms and enforcedeadline constraints by using a fast load sharing interconnectionnetwork that can schedule tasks with communication delays on the orderof microseconds. They have evaluated their approach under Poisson andbursty arrivals assumptions. They have simulated the effect of systemsize, different local scheduling algorithms, burstiness, burst length,thresholds, and of end of slot scheduling. They concluded that loadsharing can be used effectively in order to schedule jobs in hard realtime systems
展开▼
