Some Investigations on FCFS Scheduling in Hard Real Time Applications
暂无分享,去创建一个
[1] Philippe Flajolet,et al. Analyse d'algorithmes de manipulation d'arbres et de fichiers , 1981 .
[2] Philippe Flajolet,et al. The Number of Registers Required for Evaluating Arithmetic Expressions , 1979, Theor. Comput. Sci..
[3] E. Bender. Asymptotic Methods in Enumeration , 1974 .
[4] Carl A. Gunter,et al. In handbook of theoretical computer science , 1990 .
[5] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .
[6] Donald E. Knuth,et al. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .
[7] H. D. Miller. Combinatorial methods in the theory of stochastic processes , 1968, Comput. J..
[8] N. D. Bruijn. Asymptotic methods in analysis , 1958 .
[9] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[10] Helmut Prodinger,et al. On the Recursive Depth of Special Tree Traversal Algorithms , 1987, Inf. Comput..
[11] Johann Blieberger,et al. Preemptive LCFS Scheduling in Hard Real-Time Applications , 1992, Perform. Evaluation.
[12] Donald E. Knuth,et al. The art of computer programming: V.1.: Fundamental algorithms , 1997 .
[13] Donald E. Knuth,et al. The art of computer programming: sorting and searching (volume 3) , 1973 .
[14] J. Conway,et al. Functions of a Complex Variable , 1964 .
[15] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .