Sue Nagy and Azer Bestavros. Admission control for soft-deadline transactions in accord. In 3 rd IEEE Real-time Technology and Applications Symposium,Montreal, Canada, June 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Clustering, Resource Management, and Replication Support for.. - Shen (2002) (Correct)
....VIP class client can be configured to produce higher service yield than serving a regular client. Secondly, each service class can be guaranteed to receive a certain portion of system resources. Most previous service differentiation studies have focused on one of the above two means of QoS support [17, 55, 63, 80]. We believe a combination of them provide two benefits when system is overloaded: 1) the resource allocation is biased toward high yield classes for efficient resource utilization; 2) a certain portion of system resources can be guaranteed for each service class, if needed. The second benefit is ....
....This study of resource management is geared toward replicated service nodes for each such data partition. Service scheduling. Deadline scheduling, proportional share resource scheduling, and value based scheduling have been studied in both real time systems and general purpose operating systems [17, 50, 52, 55, 63, 73, 80]. Client request rates for Internet services tend to be bursty and fluctuate dramatically from time to time [13, 23, 27] Delivering satisfactory user experience is important during load spikes. Based on an adaptive scheduling approach and a resource consumption estimation scheme, the service ....
S. Nagy and A. Bestavros. Admission Control for Soft-Deadline Transactions in ACCORD. In Proc. of IEEE Real-Time Technology and Applications Symposium, pages 160--165, Montreal, Canada, June 1997.
Concurrency Admission Control Management in ACCORD - Sue Nagy Azer (1997) Self-citation (Nagy Bestavros) (Correct)
No context found.
Sue Nagy and Azer Bestavros. Admission control for soft-deadline transactions in accord. In 3 rd IEEE Real-time Technology and Applications Symposium,Montreal, Canada, June 1997.
Concurrency Admission Control For RT Databases - Nagy, Bestavros Self-citation (Nagy Bestavros) (Correct)
....this 2 tier priority assumption still allows primary tasks (compensating tasks) to be prioritized amongst themselves. In this paper we study our admission control mechanisms in conjunction with two types of concurrency control protocols, namely Optimistic Concurrency 4 Our current research in [26] involves extending our results to soft and firm deadline systems by allowing for a profit loss past a transaction s deadline. Concurrency Admission Control 5 Control with forward validation (such as OCC BC [25] or SCC nS [5] or Pessimistic Concurrency Control (PCC) with Priority Abort (such ....
Sue Nagy and Azer Bestavros. Admission control for soft-deadline transactions in accord. In 3 rd IEEE Real-time Technology and Applications Symposium, pages 160--165, Montreal, Canada, June 1997.
Concurrency Admission Control Management in ACCORD - Nagy, Bestavros Self-citation (Nagy Bestavros) (Correct)
....we assume a 2 tier priority scheme for CPU scheduling purposes. In particular, all compensating tasks are assumed to have a higher priority than primary tasks. Thus a primary task may be preempted (or aborted) by a compensating task, whereas a compensating task cannot 4 Our current research in [31] involves extending our results to soft and firm deadline systems by allowing for a profit loss past a transaction s deadline. be preempted by either a primary task or another compensating task under any condition. Notice that this 2 tier priority assumption still allows primary tasks ....
Sue Nagy and Azer Bestavros. Admission control for soft-deadline transactions in accord. In 3 rd IEEE Real-time Technology and Applications Symposium, Montreal, Canada, June 1997.
Integrated Resource Management for Cluster-based Internet.. - Kai Shen Hong (2002) (14 citations) (Correct)
No context found.
S. Nagy and A. Bestavros. Admission Control for Soft-Deadline Transactions in ACCORD. In Proc. of IEEE Real-Time Technology and Applications Symposium, pages 160--165, Montreal, Canada, June 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC