3,109 Hits in 2.9 sec

Buddy System: Available, Consistent, Durable Web Service Transactions

Aspen Olmsted, Csilla Farkas
2013 Journal of Internet Technology and Secured Transaction  
Our first implementation schedules fine-grained WS transactions. In these transactions each activity is a low level database operation.  ...  We show that our approach guarantees one-copy serializability, matches the performance of the lazy update propagation methods, and increases durability in the presence of hardware failures.  ...  The dispatcher can then extract the semantics from the model and distribute the requests to clusters as it did with the fine-grained web service.  ... 
doi:10.20533/jitst.2046.3723.2013.0018 fatcat:jpjbx4vu3jhlbg65265tcwjcna

Toward replication in grids for digital libraries with freshness and correctness guarantees

Fuat Akal, Heiko Schuldt, Hans-Jörg Schek
2008 Concurrency and Computation  
Lazy replication protocols provide good scalability properties by decoupling transaction execution from the propagation of new values to replica sites while guaranteeing a correct and more efficient transaction  ...  The protocol exploits the distinction between read-only and update transactions and works with arbitrary physical data organizations such as partitioning and striping as well as different replica granularities  ...  The proposed protocol PDBREP supports both freshness and correctness guarantees.  ... 
doi:10.1002/cpe.1298 fatcat:iknmuzas7nd3dpmu3ocurs6g5q

Strongly consistent replication for a bargain

Konstantinos Krikellas, Sameh Elnikety, Zografoula Vagena, Orion Hodson
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
Strong consistency is an important correctness property for replicated databases. It ensures that each transaction accesses the latest committed database state as provided in centralized databases.  ...  We propose two scalable techniques that exploit lazy update propagation and workload information to guarantee strong consistency by delaying transaction start.  ...  ACKNOWLEDGMENTS We thank Antony Rowstron (Microsoft Research), Alan Fekete (University of Sydney), and Fernando Pedone (University of Lugano) for their insightful suggestions and valuable feedback.  ... 
doi:10.1109/icde.2010.5447893 dblp:conf/icde/KrikellasEVH10 fatcat:aur6rpqnyvcyvnw3yz7adfw5ty

Hierarchical Replication Control in a Global File System

Jiaying Zhang, Peter Honeyman
2007 Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)  
With the introduction of the hierarchical replication control, the overhead of replication is negligible even when applications mostly write and replication servers are widely distributed.  ...  The system uses a hierarchical replication control protocol that dynamically elects a primary server at various granularities.  ...  Figure 5 . 5 Fine-grained replication control vs. hierarchical replication control. The first column shows the time to build SSH using fine-grained replication control.  ... 
doi:10.1109/ccgrid.2007.57 dblp:conf/ccgrid/ZhangH07 fatcat:w3oml3vt7vevbdq3h7jc3lvo3q

A replicated file system for Grid computing

Jiaying Zhang, Peter Honeyman
2008 Concurrency and Computation  
With the introduction of a hierarchical replication control protocol, the overhead of replication is negligible even when applications mostly write and replication servers are widely distributed.  ...  To meet the rigorous demands of large-scale data sharing in global collaborations, we present a replication scheme for NFSv4 that supports mutable replication without sacrificing strong consistency guarantees  ...  SCI-0438298 and Network Appliance, Inc.  ... 
doi:10.1002/cpe.1286 fatcat:shwbuglgevfmteh6cpdf4pgbai

A Customizable and Secure Software Architecture

Aspen Olmsted, RoxAnn Stalvey
2014 International Journal for Information Security Research  
We consider ways of adding runtime configurable interception points for after release customization while guaranteeing the correctness of the entire operation.  ...  In this paper, we investigate the problem of providing customization opportunities at implementation time while maintaining consistency, high availability and durability for distributed web-service transactions  ...  The knowledge of the data read and created by a web-service allowed the dispatcher to map from the course-grained web service to the fine grained CRUD operations required by the dispatcher algorithm [  ... 
doi:10.20533/ijisr.2042.4639.2014.0058 fatcat:gtstqrfsjjgrnl33eqfeyivojm

Service Constraint Guarantees

Aspen Olmsted, RoxAnn Stalvey
2014 International Journal of Intelligent Computing Research  
We consider enforcement of integrity constraints in a way that increases the availability while guaranteeing the correctness specified in the constraint.  ...  We propose an approach that guarantees enforcement of constraints and also allow the distribution of write operations among many clusters to increase the availability.  ...  Using the method from our previous work mapping course grained services to fine grained services [18] we are able to auto generate compensators.  ... 
doi:10.20533/ijicr.2042.4655.2014.0055 fatcat:327gkfdcsrbcjitjqzjzyvbdkq

POLARIS: The Distributed SQL Engine in Azure Synapse

Josep Aguilar-Saborit, Raghu Ramakrishnan
2020 Proceedings of the VLDB Endowment  
Achieving these goals required many innovations, including a novel "cell" data abstraction, and flexible, fine-grained, task monitoring and scheduling capable of handling partial query restarts and PB-scale  ...  Most importantly, while we develop a completely new scale-out framework, it is fully compatible with T-SQL and leverages decades of investment in the SQL Server single-node runtime and query optimizer.  ...  Fine grain control at large scale often comes with memory requirements and thread contention due to many subroutines running concurrently.  ... 
dblp:journals/pvldb/Aguilar-Saborit20 fatcat:dcodzvwpmbct3jhm2sxukpwsfm

How replicated data management in the cloud can benefit from a data grid protocol

Laura Cristiana Voicu, Heiko Schuldt
2009 Proceeding of the first international workshop on Cloud data management - CloudDB '09  
Quality of service agreements with customers require data to be replicated across data centers in order to guarantee a high degree of availability.  ...  Due to the great success of the first generation of Cloud-based services, providers have to deal with larger and larger volumes of data.  ...  In our future work, we plan to integrate support for more fine-grained replication into Re:GRIDiT for supporting multi-tenant applications in the Cloud.  ... 
doi:10.1145/1651263.1651272 dblp:conf/cikm/VoicuS09 fatcat:dgu22dgxwfgztewp4ureskm7zq

A Taxonomy of Data Grids for Distributed Data Sharing, Management and Processing [article]

Srikumar Venugopal, Rajkumar Buyya, Kotagiri Ramamohanarao
2005 arXiv   pre-print
We then provide comprehensive taxonomies that cover various aspects of architecture, data transportation, data replication and resource allocation and scheduling.  ...  They combine high-end computing technologies with high-performance networking and wide-area storage management techniques.  ...  We would also like to express our gratitude to Reagan Moore (San Diego Supercomputing Center) for his extensive and thought provoking comments and suggestions on various aspects of this taxonomy.  ... 
arXiv:cs/0506034v1 fatcat:com2we7confwvil3zz6kqubg5u


Idrissa Sarr, Hubert Naacke, Stéphane Gançarski
2010 Proceedings of the 2010 ACM Symposium on Applied Computing - SAC '10  
To this end, databases are replicated over a P2P system in order to achieve high availability and fast transaction processing thanks to parallelism.  ...  Both metadata and data are accessed in an optimistic way: there is no locking on metadata and transactions are executed on nodes in a tentative way.  ...  Potential conflicting transactions are first executed on different nodes before a fine-grain mechanism is used to check real conflicts: in case of a real conflict, one transaction at least is aborted.  ... 
doi:10.1145/1774088.1774179 dblp:conf/sac/SarrNG10 fatcat:6bb6j7h245bnzoqcyfwqzipatu

Supporting Dynamically Changing Authorizations in Pervasive Communication Systems [chapter]

Adam J. Lee, Jodie P. Boyer, Chris Drexelius, Prasad Naldurg, Raquel L. Hill, Roy H. Campbell
2005 Lecture Notes in Computer Science  
We also provide a proof of correctness of key agreement and freshness using the standard BAN deduction system.  ...  In this paper, we present an authorization framework, in the context of the Gaia OS for active spaces, which integrates context with authorization and provides fine-grained control over the enforcement  ...  In this paper we present an access control architecture that integrates context with authorization and provides fine-grained control over the enforcement of dynamically changing permissions.  ... 
doi:10.1007/978-3-540-32004-3_15 fatcat:tragtmjeyvb6jcc22x53yerq2i

Towards Concurrent Stateful Stream Processing on Multicore Processors (Technical Report) [article]

Shuhao Zhang, Yingjun Wu, Feng Zhang, Bingsheng He
2020 arXiv   pre-print
Their coarse-grained processing paradigm further magnifies contention issues and tends to poorly utilize modern multicore architectures.  ...  The experimental results show that 1) TStream achieves up to 4.8 times higher throughput with similar processing latency compared to the state-of-the-art and 2) unlike prior solutions, TStream is highly  ...  A DSPS ensuring a correct state transaction schedule always guarantees deterministic state access sequence (F3). C.  ... 
arXiv:1904.03800v4 fatcat:ehedwqmsdjhhjbicpezt2nwnc4

Small trusted primitives for dependable systems

Petros Maniatis, Byung-Gon Chun
2011 ACM SIGOPS Operating Systems Review  
We describe the benefits of using these primitives to increase the fault-tolerance of replicated systems and archival storage, and to improve the security of email SPAM and click-fraud prevention systems  ...  In our recent work, we have explored this trade-off by defining "small," generic trusted primitives-for example, an attested, monotonically sequenced FIFO buffer of a few hundred machine words guaranteed  ...  We would also like to thank our colleague Jaeyeon Jung for providing us with detailed guidance on how to present this article best.  ... 
doi:10.1145/1945023.1945038 fatcat:wycqymcve5aeflzpkcis4fdaey

Experience with a clustered parallel reduction machine

M Beemster, P.H Hartel, L.O Hertzberger, R.F.H Hofman, K.G Langendoen, L.L Li, R Milikowski, WG Vree, H.P Barendregt, J.C Mulder
1993 Future generations computer systems  
A prototype of a single cluster machine has been constructed with stock hardware. This paper describes the experience with the project and its current state.  ...  Sophisticated compilation techniques are used such as strictness analysis on non-flat domains and RISC and VLIW code generation. Parallel jobs are distributed by an efficient hierarchical scheduler.  ...  The FAST compiler represents joint work with Hugh Glaser and John Wild, which is supported by the Science and Engineering Research Council, UK, under grant No.  ... 
doi:10.1016/0167-739x(93)90011-d fatcat:ank45yd6czgm5hmbfoaqws33mm
« Previous Showing results 1 — 15 out of 3,109 results