Results 271 to 280 of about 16,132 (297)
Some of the next articles are maybe not open access.
An adaptive rate processor sharing technique
IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211), 2002An alternative approach for the common problem of computing the weights of a general processor sharing (GPS) server is presented. The rate processor sharing (RPS) algorithm of Kumaran and Whiting (see Bell Labs Internal Report, July, 1999), which is based on GPS, is modified in order to remove some of its drawbacks: difficulty in setting its parameters,
Aikaterini Varsou, H. Vincent Poor
openaire +1 more source
Processor sharing: A survey of the mathematical theory
Automation and Remote Control, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yashkov, S. F., Yashkova, A. S.
openaire +1 more source
A processor allocation method for time-sharing
Communications of the ACM, 1970A scheduling algorithm is proposed which is intended to minimize changes of tasks on processors and thereby reduce overhead. The algorithm also has application to more general resource allocation problems. It is implemented by means of a method for efficiently handling dynamically changing segmented lists.
Alvin P. Mullery, Graham C. Driscoll
openaire +2 more sources
Minimizing energy on homogeneous processors with shared memory
Theoretical Computer Science, 2020This paper considers the system-wide energy-efficient task scheduling problem in a system architecture equipped with a multi-core processor and a shared main memory. The focus is on the case when the number of tasks is greater than the number of cores, which has been proved to be NP-hard if the number of cores is at least 2. For the multiple-cores case,
Vincent Chau +4 more
openaire +2 more sources
Two load sharing processors with failures
Computers & Operations Research, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tayfur Alfok +2 more
openaire +2 more sources
On the transient behavior of the processor sharing queue
Queueing Systems, 1994The transient behavior of the single server queue under the processor sharing discipline is analysed. The rate of growth of the number of customers in the queue as well as the asymptotic behavior of the residual service times described in terms of a renormalized point process are given.
Alain Jean-Marie, Philippe Robert
openaire +1 more source
Dynamic processor sharing in torus multicomputers
Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing, 2002This paper proposes a distributed dynamic processor sharing scheme in torus-connected multicomputer systems. It is applicable to database query and on-line transaction processing applications. In such a system, each processor can process small transaction tasks locally and support parallel execution of large transaction tasks in a timesharing fashion ...
Yi-Long Chen, Ying Zhang, Jyh-Charn Liu
openaire +1 more source
Data sharing protocols for SMT processors
Proceedings of the 2006 ACM symposium on Applied computing, 2006Although there are many real-time task synchronization protocols designed for uniprocessor and multiprocessor systems, most of them do not fit the needs in accommodating simultaneous multithreading (SMT). Real-time synchronization protocols are expected to bound the maximum number of priority inversions and to meet task deadlines.
openaire +1 more source
Initializing memory shared by several processors
International Journal of Parallel Programming, 1989zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources