The Community for Technology Leaders
Green Image
Issue No. 09 - September (1982 vol. 31)
ISSN: 0018-9340
pp: 898
V.A. Signaevskii , Control Computers Institute
In the above paper1 the author has investigated a problem of the preemptive scheduling of n independent tasks T = {T<inf>1</inf>, T<inf>2</inf>, ???, T<inf>n</inf>} on m identical uniprogrammed CPU's P<inf>1</inf>, P<inf>2</inf>, ???, P<inf>m</inf>when a common primary memory of N pages is available. Each task T<inf>i</inf>is specified by the virtual time vi and the progress rate p<inf>i</inf>(s<i
V.A. Signaevskii, "Comments on "Multiprocessor Scheduling with Memory Allocation?A Deterministic Approach"", IEEE Transactions on Computers, vol. 31, no. , pp. 898, September 1982, doi:10.1109/TC.1982.1676105
99 ms
(Ver 3.3 (11022016))