This paper discusses the response time problem for concurrent processes sharing resources which are granted according to an FCFS strategy. The problem is shown to be NP-hard, but when less than four resources are shared, a restricted case is shown to be solvable in linear time.
|Number of pages||4|
|Journal||Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E|
|Publication status||Published - Aug 1 1986|
All Science Journal Classification (ASJC) codes