Filters








4,961 Hits in 6.5 sec

Fast portable orthogonally persistent JavaTM

Alonso Marquez, John N. Zigman, Stephen M. Blackburn
2000 Software, Practice & Experience  
Such transformations can be used for a range of purposes, including optimization and semantic extension. In this paper we present a framework for semantic extensions in Java.  ...  The use of semi-dynamic program transformations lends our orthogonally persistent Java a number of important qualities, including simplicity, portability and a clean model of persistence.  ...  set to make read and write barriers explicit.  ... 
doi:10.1002/(sici)1097-024x(20000410)30:4<449::aid-spe306>3.3.co;2-p fatcat:5qabuoe5lzdhnik6jinyi6h7qi

Implementing Orthogonally Persistent Java [chapter]

Alonso Marquez, Stephen M. Blackburn, Gavin Mercer, John Zigman
2001 Lecture Notes in Computer Science  
Our design approach is anchored by the view that any system that brings together Java and orthogonal persistence should as far as possible avoid diluting the strengths of Java or the principles of orthogonal  ...  Our approach is thus distinguished by three features: complete transparency of persistence, support for both intra and inter application concurrency through ACID transactions, and the preservation of Java's  ...  Conclusions We have designed and built an orthogonally persistent Java system, strongly motivated by the desire to remain true to the principles of orthogonal persistence without sacrificing Java's strengths  ... 
doi:10.1007/3-540-45498-5_22 fatcat:en7jxbqcibbqjmkrgsfzbx5d7e

Mostly-copying reachability-based orthogonal persistence

Antony L. Hosking, Jiawan Chen
1999 Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '99  
Our scheme extends Bartlett's mostly-copying garbage collector to manage both transient objects and resident persistent objects, and to compute the reachability closure necessary for stabilization of the  ...  We describe how reachability-based orthogonal persistence can be supported even in uncooperative implementations of languages such as C++ and Modula-3, and without modification to the compiler.  ...  Aria Novianto participated in many of our early discussions on mostly-copying persistence. This research is supported in part by the National Science Foundation under Grant No.  ... 
doi:10.1145/320384.320427 dblp:conf/oopsla/HoskingC99 fatcat:lk3ibh2uanekzka6kau34i73ay

Mostly-copying reachability-based orthogonal persistence

Antony L. Hosking, Jiawan Chen
1999 SIGPLAN notices  
Our scheme extends Bartlett's mostly-copying garbage collector to manage both transient objects and resident persistent objects, and to compute the reachability closure necessary for stabilization of the  ...  We describe how reachability-based orthogonal persistence can be supported even in uncooperative implementations of languages such as C++ and Modula-3, and without modification to the compiler.  ...  Aria Novianto participated in many of our early discussions on mostly-copying persistence. This research is supported in part by the National Science Foundation under Grant No.  ... 
doi:10.1145/320385.320427 fatcat:qiqvpkyu5jcsfkufomytfhkadm

Architecture of the PEVM: A High-Performance Orthogonally Persistent Java™ Virtual Machine [chapter]

Brian Lewis, Bernd Mathiske, Neal Gafter
2001 Lecture Notes in Computer Science  
The Forest project at Sun Microsystems Laboratories and the Persistence and Distribution Group at Glasgow University are developing orthogonal persistence for the Java platform (OPJ) [AM95].  ...  This paper describes the design and implementation of the PEVM, a new scalable, high-performance implementation of orthogonal persistence for the Java™ platform (OPJ).  ...  We compared the PEVM's performance to several commercial persistence solutions for the Java platform, and found it as fast or faster; however, we cannot quote specific numbers due to licensing restrictions  ... 
doi:10.1007/3-540-45498-5_3 fatcat:miue5rjksvcf7n2psdaadhmpwa

Delegated persist ordering

Aasheesh Kolli, Jeff Rosen, Stephan Diestelhorst, Ali Saidi, Steven Pelley, Sihang Liu, Peter M. Chen, Thomas F. Wenisch
2016 2016 49th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO)  
Ensuring persistent data structure recoverability requires constraints on the order PM writes become persistent. But, current memory systems reorder writes, providing no such guarantees.  ...  Instead, we propose delegated ordering, wherein ordering requirements are communicated explicitly to the PM controller, fully decoupling PM write ordering from volatile execution and cache management.  ...  ACKNOWLEDGEMENTS We would like to thank the anonymous reviewers for their valuable feedback. This work was supported by the National Science Foundation under the award NSF-CCF-1525372.  ... 
doi:10.1109/micro.2016.7783761 dblp:conf/micro/KolliRDSPLCW16 fatcat:qudsk3fy3zh4fljgldiyw5laei

Schedulable persistence system for teal-time applications in virtual machine

Okehee Goh, Yann-Hang Lee, Ziad Kaakani
2006 Proceedings of the 6th ACM & IEEE International conference on Embedded software - EMSOFT '06  
The experiment output on the prototyped system illustrates that persistence service is appropriate for realtime applications because of its controllable pause time and its optimized overhead.  ...  By employing object serialization, the system enables concurrent and preemptible persistence operation, i.e., the task in charge of persistence service runs concurrently with application tasks and is a  ...  The roles of the buffers are switched back and forth such that the write and read operations are performed concurrently.  ... 
doi:10.1145/1176887.1176916 dblp:conf/emsoft/GohLK06 fatcat:4ojmlfuaznhspdljtbg5flnhaq

Automatic and transparent I/O optimization with storage integrated application runtime support

Noah Watkins, Zhihao Jia, Galen Shipman, Carlos Maltzahn, Alex Aiken, Pat McCormick
2015 Proceedings of the 10th Parallel Data Storage Workshop on - PDSW '15  
As a result, programming models, languages, and storage systems are limited in the optimizations they can perform for I/O operations, as the semantics of the I/O library is typically at the level of transfers  ...  and application level co-optimizations.  ...  The first phase (dark) is write and the second phase (grey) is read. The horizontal transition from the write phase to the read phase represents the I/O for single shard.  ... 
doi:10.1145/2834976.2834983 dblp:conf/sc/WatkinsJSMAM15 fatcat:vllpjh5oz5acxdsgqicugvuoty

Providing orthogonal persistence for Java [chapter]

Malcolm Atkinson, Mick Jordan
1998 Lecture Notes in Computer Science  
Acknowledgements This research is supported by a collaborative research grant from SunLabs, by a grant from the British Engineering and Physical Sciences Research Council, and by a scholarship from the  ...  They also have to mark methods (whole classes) as handling potentially persistent objects, presumably so that the read barrier for object faulting can be selectively inserted.  ...  In a few cases, application programmers are being asked to manually achieve the effect of a write barrier; they have to write code to explicitly notify that an object has been updated.  ... 
doi:10.1007/bfb0054100 fatcat:gbwrslsmmjanrf5yzpdfcrlrey

Orthogonal Persistence Revisited [chapter]

Alan Dearle, Graham N. C. Kirby, Ron Morrison
2010 Lecture Notes in Computer Science  
The cost of the conceptual and technological differences between these two models became known as the impedance mismatch [19] , and was one of the primary motivations for the work on orthogonal persistence  ...  In particular we review programming language support for the concept of orthogonal persistence, a technique for the uniform treatment of objects irrespective of their types or longevity.  ...  Instead, read and write barriers are introduced by dynamic byte-code modification.  ... 
doi:10.1007/978-3-642-14681-7_1 fatcat:k7zr4by5enf2zf2vl6buyr4vay

Orthogonal Persistence Revisited [article]

Alan Dearle, Graham Kirby, Ron Morrison
2010 arXiv   pre-print
In particular we review programming language support for the concept of orthogonal persistence, a technique for the uniform treatment of objects irrespective of their types or longevity.  ...  We relate these attempts to the original principles of orthogonal persistence and give a few hints about how the concept may be utilised in the future.  ...  Instead, read and write barriers are introduced by dynamic byte-code modification.  ... 
arXiv:1006.3448v1 fatcat:zcylekkjx5hnhdp74bbemqex2m

Run-Time Support for Distributed Sharing in Typed Languages [chapter]

Y. Charlie Hu, Weimin Yu, Alan L. Cox, Dan S. Wallach, Willy Zwaenepoel
2000 Lecture Notes in Computer Science  
The key to its efficiency is the observation that a handle-based distributed implementation permits VM-based access and modification detection without suffering false sharing for fine-grained access patterns  ...  The performance of fine-grained applications and garbage-collected applications is considerably better than in TreadMarks, and the performance of coarse-grained applications is nearly as good as in TreadMarks  ...  Stan Zdonik for their helpful comments and discussions on this work.  ... 
doi:10.1007/3-540-40889-4_15 fatcat:q2eint3lpfcjxa4amsgpk75wcu

Run-time support for distributed sharing in safe languages

Y. Charlie Hu, Weimin Yu, Alan Cox, Dan Wallach, Willy Zwaenepoel
2003 ACM Transactions on Computer Systems  
The key to its efficiency is the observation that a handle-based distributed implementation permits VM-based access and modification detection without suffering false sharing for fine-grained access patterns  ...  The performance of fine-grained applications and garbage-collected applications is considerably better than in TreadMarks, and the performance of coarse-grained applications is nearly as good as in TreadMarks  ...  Stan Zdonik for their helpful comments and discussions on this work.  ... 
doi:10.1145/592637.592638 fatcat:7qh2uoufjnamxokflw7mfkzriy

FIRM: Fair and High-Performance Memory Control for Persistent Memory Systems

Jishen Zhao, Onur Mutlu, Yuan Xie
2014 2014 47th Annual IEEE/ACM International Symposium on Microarchitecture  
These characteristics undermine the high-performance and fairness offered by conventional memory scheduling schemes designed for non-persistent applications.  ...  due to low bank-level parallelism, frequent write queue drains, and frequent bus turnarounds between reads and writes.  ...  ACKNOWLEDGMENTS We thank the anonymous reviewers for their valuable feedback. Zhao  ... 
doi:10.1109/micro.2014.47 dblp:conf/micro/ZhaoM014 fatcat:2y4cbcvjxza5zdovnrdin3j7vy

Eigenbench: A simple exploration tool for orthogonal TM characteristics

Sungpack Hong, Tayo Oguntebi, Jared Casper, Nathan Bronson, Christos Kozyrakis, Kunle Olukotun
2010 IEEE International Symposium on Workload Characterization (IISWC'10)  
We propose a set of orthogonal application characteristics that form a basis for transactional behavior and are useful in fully understanding the performance of a TM system.  ...  We show that EigenBench is useful for thoroughly exploring the orthogonal space of TM application characteristics.  ...  Acknowledgements This work is supported by DOE contract, Sandia order 942017; Army contract AHPCRC W911NF-07-2-0027-1; DARPA contract, Oracle order 630003198; and Stanford PPL affiliates program, Pervasive  ... 
doi:10.1109/iiswc.2010.5648812 dblp:conf/iiswc/HongOCBKO10 fatcat:ebjvrcigbvhj5l6snqlid6gb4m
« Previous Showing results 1 — 15 out of 4,961 results