Filters








7,070 Hits in 3.2 sec

Transaction Isolation and Lazy Commit

Vishal Kathuria, Robin Dhamankar, Hanuma Kodavalla
2007 2007 IEEE 23rd International Conference on Data Engineering  
We present a solution that provides the efficiency of lazily committed transactions and the flexibility for other transactions to read only durably committed data.  ...  If another transaction reads such lazily committed data and performs an independently committed external action based on it, then an inconsistency may result if the effects of the lazily committed transaction  ...  Acknowledgements We thank our colleagues -Michael Zwilling for his contributions to the algorithm, Avi Levy and Rajesh Iyer for testing the implementation and Atul Adya for a timely review.  ... 
doi:10.1109/icde.2007.368979 dblp:conf/icde/KathuriaDK07 fatcat:nge2cisbrnbfpmcwjogklt3akm

Lazy Database Replication with Snapshot Isolation

Khuzaima Daudjee, Kenneth Salem
2006 Very Large Data Bases Conference  
Furthermore, guaranteeing snapshot isolation in lazy replicated systems may result in transaction inversions, which happen when transactions see stale data.  ...  Strong snapshot isolation, which is provided in centralized database servers, avoids transaction inversions but is expensive to provide in a lazy replicated system.  ...  This is the trade-off between transaction isolation and performance. Higher degrees of transaction isolation guarantee fewer anomalies but with larger performance penalties.  ... 
dblp:conf/vldb/DaudjeeS06 fatcat:scbtozuclnhjfcpby37qjw7lji

Leveraging transactional memory for a predictable execution of applications composed of hard real-time and best-effort tasks

Stefan Metzlaff, Sebastian Weis, Theo Ungerer
2013 Proceedings of the 21st International conference on Real-Time Networks and Systems - RTNS '13  
guarantee for each transaction Calculable number of transaction aborts Supports eager and lazy conflict detection Enhancement for non real-time HRT contention manager with a two-level commit scheduling  ...  Commit Abort 1 2 3 4 1 2 3 4 2 3 4 3 4 4 Commit Queue t Lazy Fewer rollback in case of conflicts Global progress stall depends on ratio of the largest and smallest transaction  ... 
doi:10.1145/2516821.2516832 dblp:conf/rtns/MetzlaffWU13 fatcat:jbztq4l5tbh4zhj4bc6t45rvqe

Version management alternatives for hardware transactional memory

Marc Lupon, Grigorios Magklis, Antonio González
2008 Proceedings of the 9th workshop on MEmory performance DEaling with Applications, systems and architecture - MEDEA '08  
Limiting the buffer size to 32 entries, we obtain 20.1% average improvement over log-based HTM for applications with fine-grain transactions (using lazy version management) and 54.7% for applications with  ...  One of these mechanisms is data version management, that decides how and where the modifications introduced by transactions are stored to guarantee their atomicity and durability.  ...  Similar to database transactions, TM defines the execution of a transaction to be atomic, isolated, durable and consistent.  ... 
doi:10.1145/1509084.1509094 fatcat:t3qtssordnh47i7db7yqusyssa

The cost of increased transactional correctness and durability in distributed databases

Aspen Olmsted, Csilla Farkas
2012 2012 IEEE 13th International Conference on Information Reuse & Integration (IRI)  
., effects of the transaction are preserved even if the server, executing the transaction, crashes before the update can be propagated to the other replicas) and efficiency (i.e., our approach requires  ...  We show that the popular lazy replica update propagation method is vulnerable to loss of transactional updates in the presence of hardware failures.  ...  The three main components of our proposed system are: 1) Synchronous Transactional Buddy System, 2) Version Master-Slave Lazy Replication, and 3) Serializable Snapshot Isolation Schedule.  ... 
doi:10.1109/iri.2012.6303042 dblp:conf/iri/OlmstedF12 fatcat:wb6nhfyixrbibczohhboyoy7jy

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)  
We propose two scalable techniques that exploit lazy update propagation and workload information to guarantee strong consistency by delaying transaction start.  ...  It ensures that each transaction accesses the latest committed database state as provided in centralized databases.  ...  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

Flexible Decoupled Transactional Memory Support

Arrvindh Shriraman, Sandhya Dwarkadas, Michael L. Scott
2008 SIGARCH Computer Architecture News  
It is, to our knowledge, the first hardware TM to implement lazy commits and aborts as entirely local operations, even with parallel commits in multiple threads.  ...  Optimistic (lazy) systems delay conflict management until commit time (though they may detect conflicts earlier).  ...  In lazy mode, transactions abort enemies at commit-time, by which time the likelihood of committing is very high.  ... 
doi:10.1145/1394608.1382134 fatcat:hnt46ouzcba3hhlrjeywq6jbrq

Flexible Decoupled Transactional Memory Support

Arrvindh Shriraman, Sandhya Dwarkadas, Michael L. Scott
2008 2008 International Symposium on Computer Architecture  
It is, to our knowledge, the first hardware TM to implement lazy commits and aborts as entirely local operations, even with parallel commits in multiple threads.  ...  Optimistic (lazy) systems delay conflict management until commit time (though they may detect conflicts earlier).  ...  In lazy mode, transactions abort enemies at commit-time, by which time the likelihood of committing is very high.  ... 
doi:10.1109/isca.2008.17 dblp:conf/isca/ShriramanDS08 fatcat:kwyihhdwpbentfbnd4anoqzaei

Immortal DB

David Lomet, Roger Barga, Mohamed F. Mokbel, German Shegalov, Rui Wang, Yunyue Zhu
2005 Proceedings of the 2005 ACM SIGMOD international conference on Management of data - SIGMOD '05  
Lazy timestamping propagates timestamps to all updates of a transaction after commit.  ...  It also supports snapshot isolation concurrency control. Versions are stamped with the times of their updating transactions. The timestamp order agrees with transaction serialization order.  ...  This eliminates any delay at the transaction commit, resulting in shorter duration transactions, and increasing concurrency and system throughput. Lazy timestamping is not logged.  ... 
doi:10.1145/1066157.1066295 dblp:conf/sigmod/LometBMSWZ05 fatcat:ic6hwpse4repbmohuiybjnyrwq

Performance Pathologies in Hardware Transactional Memory

Jayaram Bobba, Kevin E. Moore, Haris Volos, Luke Yen, Mark D. Hill, Michael M. Swift, David A. Wood
2008 IEEE Micro  
To isolate the effects of these high-level design decisions, we develop a common framework that abstracts away differences in cache write policies, interconnects, and ISA to compare these three design  ...  Previously proposed HTMs represent three points in this design space: lazy conflict detection, lazy version management, committer wins (LL); eager conflict detection, lazy version management, requester  ...  Lazy CD/Lazy VM/Committer Wins (LL). LL systems, such as TCC [9] and Bulk [4] , buffer new values until a transaction commits.  ... 
doi:10.1109/mm.2008.11 fatcat:cgiqc6oxmfgwfjb4a62z54qkvu

Performance pathologies in hardware transactional memory

Jayaram Bobba, Kevin E. Moore, Haris Volos, Luke Yen, Mark D. Hill, Michael M. Swift, David A. Wood
2007 Proceedings of the 34th annual international symposium on Computer architecture - ISCA '07  
To isolate the effects of these high-level design decisions, we develop a common framework that abstracts away differences in cache write policies, interconnects, and ISA to compare these three design  ...  Previously proposed HTMs represent three points in this design space: lazy conflict detection, lazy version management, committer wins (LL); eager conflict detection, lazy version management, requester  ...  Lazy CD/Lazy VM/Committer Wins (LL). LL systems, such as TCC [9] and Bulk [4] , buffer new values until a transaction commits.  ... 
doi:10.1145/1250662.1250674 dblp:conf/isca/BobbaMVYHSW07 fatcat:qi5ry4a6ijgmtc7bxqgkjzphi4

Performance pathologies in hardware transactional memory

Jayaram Bobba, Kevin E. Moore, Haris Volos, Luke Yen, Mark D. Hill, Michael M. Swift, David A. Wood
2007 SIGARCH Computer Architecture News  
To isolate the effects of these high-level design decisions, we develop a common framework that abstracts away differences in cache write policies, interconnects, and ISA to compare these three design  ...  Previously proposed HTMs represent three points in this design space: lazy conflict detection, lazy version management, committer wins (LL); eager conflict detection, lazy version management, requester  ...  Lazy CD/Lazy VM/Committer Wins (LL). LL systems, such as TCC [9] and Bulk [4] , buffer new values until a transaction commits.  ... 
doi:10.1145/1273440.1250674 fatcat:rgvqeseoy5bhteq3eb234g2gai

An integrated hardware-software approach to flexible transactional memory

Arrvindh Shriraman, Michael F. Spear, Hemayet Hossain, Virendra J. Marathe, Sandhya Dwarkadas, Michael L. Scott
2007 Proceedings of the 34th annual international symposium on Computer architecture - ISCA '07  
In a strong argument for policy flexibility, we find that the choice between eager (first-access) and lazy (commit-time) conflict detection can lead to significant performance differences in both directions  ...  There has been considerable recent interest in both hardware and software transactional memory (TM).  ...  read and written transactionally even when they are also being written by some other, concurrent transaction.  ... 
doi:10.1145/1250662.1250676 dblp:conf/isca/ShriramanSHMDS07 fatcat:54hv4gotqvgcdpqppuic2epruu

An integrated hardware-software approach to flexible transactional memory

Arrvindh Shriraman, Michael F. Spear, Hemayet Hossain, Virendra J. Marathe, Sandhya Dwarkadas, Michael L. Scott
2007 SIGARCH Computer Architecture News  
In a strong argument for policy flexibility, we find that the choice between eager (first-access) and lazy (commit-time) conflict detection can lead to significant performance differences in both directions  ...  There has been considerable recent interest in both hardware and software transactional memory (TM).  ...  read and written transactionally even when they are also being written by some other, concurrent transaction.  ... 
doi:10.1145/1273440.1250676 fatcat:nfeulgj63rayfecfri25mnhjnu

Enhancing Edge Computing with Database Replication

Yi Lin, Bettina Kemme, Marta Patino-Martinez, Ricardo Jimenez-Peris
2007 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)  
and high scalability.  ...  Edge computing moves data and computation closer to end-users for fast local access and better load distribution. Current approaches use caching, which does not work well with highly dynamic data.  ...  Firstly, we provide full consistency, 1-copy-snapshot isolation, while [21] uses lazy propagation.  ... 
doi:10.1109/srds.2007.10 dblp:conf/srds/LinKPJ07 fatcat:fpf56rrvw5f6to2tphf2wa7ewy
« Previous Showing results 1 — 15 out of 7,070 results