Results 1 -
4 of
4
Correctness Proof of the Declarative SS2PL Protocol Implementation
, 2010
"... Correctness proof of the declarative SS2PL protocol implementation ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Correctness proof of the declarative SS2PL protocol implementation
Declarative Serializable Snapshot Isolation
"... Abstract. Snapshot isolation (SI) is a popular concurrency control pro-tocol, but it permits non-serializable schedules that violate database in-tegrity. The Serializable Snapshot Isolation (SSI) protocol ensures (view) serializability by preventing pivot structures in SI schedules. In this pa-per, ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract. Snapshot isolation (SI) is a popular concurrency control pro-tocol, but it permits non-serializable schedules that violate database in-tegrity. The Serializable Snapshot Isolation (SSI) protocol ensures (view) serializability by preventing pivot structures in SI schedules. In this pa-per, we leverage the SSI approach and develop the Declarative Serializ-able Snapshot Isolation (DSSI) protocol, an SI protocol that guarantees serializable schedules. Our approach requires no analysis of application programs or changes to the underlying DBMS. We present an implemen-tation and prove that it ensures serializability. 1
Smile: Enabling Easy and Fast Development of Domain-Specific Scheduling Protocols
"... Abstract. Modern server systems schedule large amounts of concur-rent requests constrained by, e.g., correctness criteria and service-level agreements. Since standard database management systems provide only limited consistency levels, the state of the art is to develop schedulers imperatively which ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. Modern server systems schedule large amounts of concur-rent requests constrained by, e.g., correctness criteria and service-level agreements. Since standard database management systems provide only limited consistency levels, the state of the art is to develop schedulers imperatively which is time-consuming and error-prone. In this poster, we present Smile (declarative Scheduling MIddLEware), a tool for develop-ing domain-specific scheduling protocols declaratively. Smile decreases the effort to implement and adapt such protocols because it abstracts from low level scheduling details allowing developers to focus on the pro-tocol implementation. We demonstrate the advantages of our approach by implementing a domain-specific use case protocol. 1
Priority Based Scheduling in a Federated Cloud Environment 1
"... Abstract: Scheduling is a process of allocating available resources to the submitted requests. The main function of scheduling is to optimize the resource utilization and response time. Cloud is a new architecture, where a huge number of requests are submitted by various customers. Some of these req ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract: Scheduling is a process of allocating available resources to the submitted requests. The main function of scheduling is to optimize the resource utilization and response time. Cloud is a new architecture, where a huge number of requests are submitted by various customers. Some of these requests need multi-tiers in federated cloud environment to perform effective execution. Since there are a huge number of requests, at times, the requests with the small scale will have to wait for a long time. In order to overcome such situation, a new scheduling algorithm is proposed based on the priorities to schedule the requests in a vertically scaled virtualized machine. This algorithm works based on the properties of requests such as depth of tier and memory size. The experimental results show that the performance of the proposed algorithm is better than the existing (FCFS) algorithm.
