Browsing by Author "C.C.Yang"

Now showing 1 - 4 of 4

A Dynamic Storage Allocation Algorithm for Multiprocessor Computer Systems
(交大學刊編輯委員會, 1972-01)
鄭武皇
;
楊超植
;
W.H.Cheng
;
C.C.Yang
In this paper a dynamic storage allocation algorithm is developed. The algorithm is very suitable for multiprocessor computer systems under multiprogramming and/or time-sharing environment. It may be considered as a dynamic Bayesian type. Since all the statistical information used in the algorithm is dynamically extracted, prerunning of programs is not required at all. The technique of biasing the working parameters and the concept of dynamic activity are both applied for developing the algorithm. It is shown that the system performance is improved on the average.Although some additional cost is small. In addition the algorithm is simple in implementation.
On The Comparison of Imcompletely Specified Finite Automata Models
(交大學刊編輯委員會, 1968-10)
楊超植
;
C.C.Yang
On the Minimization of the Number of Internal States in Incompletely Specified Sequential Machines
(交大學刊編輯委員會, 1969-04)
楊超植
;
馮慶深
;
C.C.Yang
;
H.S.Fung
The algorithm of a systematic minimization method givrn in this paper uses tree idea for generating all compatibility classes and uses Meisel's tree display to produce all possible minimal solutions of a given incompletely specified sequential machine. An example is given for illustration.
On the Modeling of Paging Algorithm by Finite Automata
(交大學刊編輯委員會, 1974-03)
楊超植
;
C.C.Yang
Two finite automata are devised for modeling two classes of demand paging algorithms. The first one of one input and three outputs models the class of algorithms each with a constant amount of allocated space. The second one of one input and six outputs models the class of algorithms each with a variable amount of allocated space. Some evaluation techniques are developed following each model. The memory states of the first class algorithm with the LRU, FIFO or FILO replacement policy or of the second class algorithm like the working set model or the page-turning rate algorithm are recursively defined by strings of the loaded pages. The adopted replacement policy and the state string updating procedure are imbedded in the recursive definition of a memory state. The operations like loading, tagging,reutilizing, etc. are reflected and differentiated by different outputs. Properties of some algorithms are developed. Sime such properties confirm with previous results and some others are updated to fit the finiteness assumtion of a reference string.