Show simple item record

dc.contributor.authorNagy, Sueen_US
dc.contributor.authorBestavros, Azeren_US
dc.date.accessioned2011-10-20T04:37:45Z
dc.date.available2011-10-20T04:37:45Z
dc.date.issued1997-05-15en_US
dc.identifier.citationNagy, Sue; Bestavros, Azer. "Concurrency Admission Control Management in ACCORD", Technical Report BUCS-1997-010, Computer Science Department, Boston University, May 15, 1997. [Available from: http://hdl.handle.net/2144/1611]en_US
dc.identifier.urihttp://hdl.handle.net/2144/1611
dc.description.abstractWe propose and evaluate admission control mechanisms for ACCORD, an Admission Control and Capacity Overload management Real-time Database framework-an architecture and a transaction model-for hard deadline RTDB systems. The system architecture consists of admission control and scheduling components which provide early notification of failure to submitted transactions that are deemed not valuable or incapable of completing on time. In particular, our Concurrency Admission Control Manager (CACM) ensures that transactions which are admitted do not overburden the system by requiring a level of concurrency that is not sustainable. The transaction model consists of two components: a primary task and a compensating task. The execution requirements of the primary task are not known a priori, whereas those of the compensating task are known a priori. Upon the submission of a transaction, the Admission Control Mechanisms are employed to decide whether to admit or reject that transaction. Once admitted, a transaction is guaranteed to finish executing before its deadline. A transaction is considered to have finished executing if exactly one of two things occur: Either its primary task is completed (successful commitment), or its compensating task is completed (safe termination). Committed transactions bring a profit to the system, whereas a terminated transaction brings no profit. The goal of the admission control and scheduling protocols (e.g., concurrency control, I/O scheduling, memory management) employed in the system is to maximize system profit. In that respect, we describe a number of concurrency admission control strategies and contrast (through simulations) their relative performance.en_US
dc.description.sponsorshipNational Science Foundation (CCR-9706685)en_US
dc.language.isoen_USen_US
dc.publisherBoston University Computer Science Departmenten_US
dc.relation.ispartofseriesBUCS Technical Reports;BUCS-TR-1997-010en_US
dc.titleConcurrency Admission Control Management in ACCORDen_US
dc.typeTechnical Reporten_US


Files in this item

This item appears in the following Collection(s)

Show simple item record