Improving scalability of task allocation and scheduling in large distributed real-time systems using shared buffers

Real-Time Technology and Applications - Proceedings

Volumn , Issue , 2003, Pages 181-188

  Kodase, Sharath ^a   Wang, Shige ^a   Gu, Zonghua ^a   Shin, Kang G ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIN PACKING ALGORITHM; DATA DEPENDENCIES; DISTRIBUTED REAL TIME SYSTEM; DISTRIBUTED SYSTEMS; END-TO-END DEADLINE; POLLING MECHANISM; TASK ALLOCATION AND SCHEDULING; TIMING CONSTRAINTS;

COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; REAL TIME SYSTEMS;

SCHEDULING;

EID: 70450268901     PISSN: 10801812     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTTAS.2003.1203050     Document Type: Conference Paper

References (12)

1. A. N. Audsley, A. Burns,M. Richardson, and K. Tindell. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, pages 284-292, 1993.
2. J. Beck and D. Siewiorek. Simulated annealing applied to multicomputer task allocation and processor specification. 8th IEEE Symposium on Parallel and Distributed Processing, pages 232-239, 1996.
3. R. Graham. Bounds on the performance of scheduling algorithms, pages 165-227. John Wiley and Sons, 1976.
4. H. Huang, P. Pillai, and K. G. Shin. Improving wait-free algorithms for interprocess communication in embedded realtime systems. Usenix Annual Technical Conference, June 2002.
5. J. Jonsson and K. Shin. Deadline assignment in distributed hard real-time systems with relaxed locality constraints. In 17th International Conference on Distributed Computing Systems, pages 27-30, Baltimore, MD, May 1997. IEEE Comput. Society.
6. M. Lin, L. Karlsson, and L. Yang. Heuristic techniques: Scheduling partially ordered tasks in a multi-processor enviroment with tabu search and genetic algorithms. 7th International Conference on Parallel and Distributed Systems, pages 515-523, 2000.
7. M. D. Natale and J. Stankovic. A simulated annealing for multiprocessor scheduling. Technical Report 10, ARTS lab, S. Anna, Pisa, 1995.
8. T. Peng, K. Shin, and T. Abdelzaher. Assignment and scheduling of communicating periodic tasks in distributed real-time systems. IEEE Transactions on Parallel and Distributed Systems, 8(12), 1997.
9. K. Ramamritham. Allocation and scheduling of precedencerelated periodic tasks. IEEE Transactions on Parallel and Distributed Systems, 6(4):412-420, April 1995.
10. A. Tarek and K. Shin. Period based load partitioning and assignment for large real time applications. IEEE Transactions on Computers, 49(1):81-87, January 2000.
11. B. Wells and C. Carroll. An augmented approach to task allocation: combining simulated annealing with list-based hueristics. Euromicro workshop on Parallel and Distributed Processing, pages 508-515, 1993.
12. T.-Y. Yen andW.Wolf. Performance estimation for real-time distributed embedded systems. IEEE Transactions on Parallel and Distributed Systems, 9(11):1125-1136, November 1998.