Deadline handling in real-time distributed objects

Proceedings - 3rd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, ISORC 2000

Volumn , Issue , 2000, Pages 7-15

  Kim, K H ^b   Liu, Juqiang ^a   Kim, Moon Hae ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NONE

Author keywords

deadline; guarantee; message triggered; object; real time; service time; time triggered; TMO

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

DEADLINE; GUARANTEE; MESSAGE TRIGGERED; OBJECT; REAL TIME; SERVICE TIME; TIME TRIGGERED;

REAL TIME SYSTEMS;

EID: 84961988054     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISORC.2000.839506     Document Type: Conference Paper

References (33)

1. M. S. Lam and R. P. Wilson. Limits of control flow on parallelism. 19th Intl. Symp. on Comp. Arch., May 1992.
2. G. S. Sohi, S. Breach, and T. N. Vijaykumar. Multiscalar processors. 22nd Intl. Symp. on Comp. Arch., June 1995.
3. E. Rotenberg, Q. Jacobson, and J. Smith. A study of control independence in superscalar processors. 5th Intl. Symp. on High Perf. Comp. Arch., Jan 1999.
4. S. Vajapeyam and T. Mitra. Improving superscalar instruction dispatch and issue by exploiting dynamic code sequences. 24th Intl. Symp. on Comp. Arch., June 1997.
5. E. Rotenberg, Q. Jacobson, Y. Sazeides, and J. Smith. Trace processors. 30th Intl. Symp. on Microarch., Dec 1997.
6. Q. Jacobson, E. Rotenberg, and J. Smith. Path-based next trace prediction. 30th Intl. Symp. on Microarch., Dec 1997.
7. J. Johnson. Expansion caches for superscalar processors. Tech. Rep. CSL-TR-94-630, Stanford Univ., June 1994.
8. A. Peleg and U. Weiser. Dynamic flow instruction cache memory organized around trace segments independent of virtual address line. U.S. Patent 5,381,533, Jan 1995.
9. E. Rotenberg, S. Bennett, and J. Smith. Trace cache: a low latency approach to high bandwidth instruction fetching. 29th Intl. Symp. on Microarch., Dec 1996.
10. S. Patel, D. Friendly, and Y. Patt. Critical issues regarding the trace cache fetch mechanism. Tech. Rep. CSE-TR-335-97, Univ. of Michigan, 1997.
11. H. Akkary and M. Driscoll. A dynamic multithreading processor. 31st Intl. Symp. on Microarch., Dec 1998.
12. M. Lipasti. Value Locality and Speculative Execution. Ph.D. thesis, Carnegie Mellon University, April 1997.
13. Y. Sazeides, S. Vassiliadis, and J. E. Smith. The performance potential of data dependence speculation and collapsing. 29th Intl. Symp. on Microarch., Dec 1996.
14. M. Franklin and G. S. Sohi. ARB: A hardware mechanism for dynamic reordering of memory references. IEEE Transactions on Computers, 45(5):552-571, May 1996.
15. A. Uht and V. Sindagi. Disjoint eager execution: An optimal form of speculative execution. 28th Intl. Symp. on Microarch., Dec 1995.
16. M. Franklin. The Multiscalar Architecture. Ph.D. thesis, University of Wisconsin, Nov 1993.
17. J. Oplinger, D. Heine, S.-W. Liao, B. Nayfeh, M. Lam, and K. Olukotun. Software and hardware for exploiting speculative parallelism in multiprocessors. Tech. Rep. CSL-TR-97-7 15, Stanford Univ., Feb 1997.
18. J. Steffan and T. Mowry. The potential for using thread-level data speculation to facilitate automatic parallelization. 4th Intl. Symp. on High Perf. Comp. Arch., Feb 1998.
19. P. Dubey, K. O'Brien, K. M. O'Brien, and C. Barton. Single-program speculative multithreading (spsm) architecture: Compiler-assisted fine-grained multithreading. PACT-95, 1995.
20. J.-Y. Tsai and P.-C. Yew. The superthreaded architecture: Thread pipelining with run-time data dependence checking and control speculation. PACT-96. 1996.
21. A. Sodani and G. S. Sohi. Dynamic instruction reuse. 23th Intl. Symp. on Comp. Arch., June 1997.
22. Y. Chou, J. Fung. and J. Shen. Reducing branch misprediction penalties via dynamic control Independence detection. Intl. Conf. on Supercomputing, June 1999.
23. A. Klauser, T. Austin, D. Grunwald, and B. Calder. Dynamic hammock predication for non-predicated instruction set architectures. PACT-98, Oct 1998.
24. S. Patel, M. Evers, and Y. Patt. Improving trace cache effectiveness with branch promotion and trace packing. 25th Intl. Symp. on Comp. Arch., June 1998.
25. J. Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Transactions on Computers. C-30(7):478-490, July 1981.
26. W. Hwu and P. Chang. Trace selection for compiling large c application programs to microcode. 21st Intl. Symp. on Microarch., Dec 1988.
27. T. N. Vijaykumar. Compiling for the Multiscalar Architecture. Ph.D. thesis, University of Wisconsin, 1998.
28. T. N. Vijaykumar and G. Sohi. Task selection for a multiscalar processor. 31st Intl. Symp. on Microarch., Dec 1998.
29. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms, pages 536-538.
30. D. Burger, T. Austin, and S. Bennett. Evaluating future microprocessors: The simplescalar toolset. Tech. Rep. CS-TR-96-1 308, Univ. of Wisconsin, July 1996.
31. E. Rotenberg, S. Bennett, and J. Smith. A trace cache microarchitecture and evaluation. IEEE Trans. on Computers, 48(2):11 I-120, Feb 1999.
32. E. Rotenberg. Trace Processors: Exploiting Hierarchy and Speculation. Ph.D. Thesis, University of Wisconsin, 1999.
33. K. Murakami. N. Irie, M. Kuga, and S. Tomita. SIMP: A Novel High-Speed Single-Processor Architecture. 16th Intl. Symp. on Comp. Arch., May 1989.