-
1
-
-
0029489058
-
Optimal combined task and message scheduling in distributed real-time systems
-
Pisa, Italy, Dec. 5-7
-
T. F. Abdelzaher and K. G. Shin. Optimal Combined Task and Message Scheduling in Distributed Real-Time Systems. Proc. of the IEEE Real-Time Systems Symposium, Pisa, Italy, Dec. 5-7, 1995, pp. 162-171.
-
(1995)
Proc. of the IEEE Real-time Systems Symposium
, pp. 162-171
-
-
Abdelzaher, T.F.1
Shin, K.G.2
-
2
-
-
0033220904
-
Combined task and message scheduling in distributed real-time systems
-
Nov.
-
T. F. Abdelzaher and K. G. Shin. Combined Task and Message Scheduling in Distributed Real-Time Systems. IEEE Trans. on Parallel and distributed systems, vol. 10, no. 11, pp. 1179-1191, Nov., 1999.
-
(1999)
IEEE Trans. on Parallel and Distributed Systems
, vol.10
, Issue.11
, pp. 1179-1191
-
-
Abdelzaher, T.F.1
Shin, K.G.2
-
3
-
-
84884631817
-
The end of the line for static cyclic scheduling?
-
IEEE Computer Society Press, Los Alamitos, Calif
-
N.C. Audsley, K.W. Tindell, and A. Burns. The End of the Line for Static Cyclic Scheduling? Proc. Fifth Euromicro Workshop on Real-Time Systems, IEEE Computer Society Press, Los Alamitos, Calif, 1993, pp. 36-41.
-
(1993)
Proc. Fifth Euromicro Workshop on Real-time Systems
, pp. 36-41
-
-
Audsley, N.C.1
Tindell, K.W.2
Burns, A.3
-
4
-
-
0029254476
-
Generating feasible cyclic schedules
-
A. Burns, N. Hayes, and M. F. Richardson. Generating feasible cyclic schedules. Control Engineering Practice, vol. 3, no. 2, pp. 151-162, 1995.
-
(1995)
Control Engineering Practice
, vol.3
, Issue.2
, pp. 151-162
-
-
Burns, A.1
Hayes, N.2
Richardson, M.F.3
-
5
-
-
33751521931
-
Heuristic scheduling for distributed hard real-time systems
-
Instiut fur Technische Informatik, Technische Universitat Wien, Austria
-
G. Fohler and C. Koza. Heuristic Scheduling for Distributed Hard Real-Time Systems. Research Report No. 6/89, Instiut fur Technische Informatik, Technische Universitat Wien, Austria, 1989.
-
(1989)
Research Report No. 6/89
, vol.6
, Issue.89
-
-
Fohler, G.1
Koza, C.2
-
6
-
-
0032682910
-
Effective complexity reduction for optimal scheduling of distributed real-time applications
-
Austin, Texas, May 31 - June 5
-
J. Jonsson. Effective Complexity Reduction for Optimal Scheduling of Distributed Real-Time Applications. In Proceedings of the IEEE International Conf. on Distributed Computing Systems, Austin, Texas, May 31 - June 5, 1999, pp. 360-369.
-
(1999)
Proceedings of the IEEE International Conf. on Distributed Computing Systems
, pp. 360-369
-
-
Jonsson, J.1
-
7
-
-
0028055490
-
A comparative study of multiprocessor list scheduling heuristics
-
Jan.
-
G. Liao and et al. A Comparative Study of Multiprocessor List Scheduling Heuristics. Proc. 27th Hawaii International Conf. System Sciences, Vol. 1, Jan. 1994, pp. 68-77.
-
(1994)
Proc. 27th Hawaii International Conf. System Sciences
, vol.1
, pp. 68-77
-
-
Liao, G.1
-
8
-
-
84882700513
-
Dynamic end-to-end guarantees in distributed real-time systems
-
San Juan, Puerto Rico, Dec. 7-9
-
M. Di Natale and J. A. Stankovic. Dynamic End-to-End Guarantees in Distributed Real-Time Systems. Proc. of the IEEE Real-Time. Systems Symposium, San Juan, Puerto Rico, Dec. 7-9, 1994, pp. 216-227.
-
(1994)
Proc. of the IEEE Real-time. Systems Symposium
, pp. 216-227
-
-
Di Natale, M.1
Stankovic, J.A.2
-
10
-
-
0028418313
-
Holistic schedulability analysis for distributed hard real-time systems
-
K. W. Tindell and J. Clark. Holistic Schedulability Analysis For Distributed Hard Real-Time Systems. Microprocessing and Micro-programming, vol. 40, pp. 117-134, 1994.
-
(1994)
Microprocessing and Micro-programming
, vol.40
, pp. 117-134
-
-
Tindell, K.W.1
Clark, J.2
-
11
-
-
0027544352
-
Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relations
-
Feb.
-
J. Xu. Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations. IEEE Trans. Software Eng., vol. 19, no. 2, pp. 139-154, Feb. 1993.
-
(1993)
IEEE Trans. Software Eng.
, vol.19
, Issue.2
, pp. 139-154
-
-
Xu, J.1
|