Publications
The documents contained in these directories are
included
by the contributing authors as a means to ensure timely dissemination
of
scholarly and technical work on a non-commercial basis. Copyright
and all rights therein are maintained by the authors or by other
copyright
holders, notwithstanding that they have offered their works here
electronically.
It is understood that all persons copying this information will adhere
to the terms and constraints invoked by each author's copyright.
These works may not be reposted without the explicit permission of the
copyright holder.
Papers published by the Association for Computing
Machinery
are Copyright © by the Association for Computing Machinery,
Inc.
Permission to make digital or hard copies of part or all of this work
for
personal or classroom use is granted without fee provided that copies
are
not made or distributed for profit or commercial advantage and that
copies
bear this notice and the full citation on the first page.
Copyrights
for components of this work owned by others than ACM must be
honored.
Abstracting with credit is permitted. To copy otherwise, to
republish,
to post on servers, or to redistribute to lists, requires prior
specific
permission and/or a fee. Request permissions from Publications
Dept,
ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.
Concurrency abstractions for programming languages using
optimistic protocols
Adam Welc. PhD Thesis, Purdue
University, May 2006.
An improved generational copying garbage collector
Philip McGachey. MS Thesis, Purdue
University, December 2005.
Safe Futures
for Java
Adam Welc, Suresh Jagannathan and Antony Hosking.
Proceedings of the ACM International Conference on Object-Oriented Programming
Systems,
Languages and Applications (San Diego, California, October 2005). ACM
SIGPLAN
Notices 40(10), October 2005, 439-453.
Nested
transactional memory: Model and preliminary architecture sketches
Revocation
techniques for Java concurrency
Adam Welc, Suresh Jagannathan and Antony Hosking.
Concurrency and Computation: Practice and Experience. To appear
A transactional
object calculus
Suresh Jagannathan, Jan Vitek, Adam Welc and Antony
Hosking.
Science of Computer Programming 57(2):164--186, August 2005
Anticipation-Based
Partial Redundancy Elimination for Static Single Assignment Form
Thomas VanDrunen and Antony Hosking. Software
- Practice and Experience 34(15):1413-1439, December
2004
Penumbra:
Simplifying Eclipse
Frank Mueller and Antony Hosking. Dr.
Dobb's Journal: Software Tools for the Professional Programmer,
#365, October, 2004, 62-66
Barriers:
Friend or Foe?
Steve Blackburn and Antony Hosking.
In Proceedings of the Third International Symposium on Memory
Management
(Vancouver, Canada, October 2004), 143-151
Software
Prefetching for Mark-Sweep Garbage Collection: Hardware Analysis and
Software Redesign
Chen-Yong Cher, Antony Hosking and
T.N.Vijaykumar.
In Proceedings of the Eleventh International Conference on
Architectural
Support for Programming Languages and Operating Systems (Boston,
Massachusetts, October 2004), 199-210
Preemption-Based
Avoidance of Priority Inversion for Java
Adam Welc, Antony Hosking and Suresh
Jagannathan.
In Proceedings of the International Conference on Parallel
Processing
(Montreal, Canada, September 2004), 529-538
Transactional
Monitors for Concurrent Objects
Adam Welc, Suresh Jagannathan and Antony
Hosking.
In Proceedings of the European Conference on Object-Oriented
Programming
(Oslo, Norway, June 2004), 519-542
Partial
Redundancy Elimination for Global Value Numbering
Thomas VanDrunen. PhD Thesis, Purdue
University,
August 2004.
A
Semantic Framework for Designer Transactions
Jan Vitek, Suresh Jagannathan, Adam Welc and Antony
Hosking.
In Proceedings of the European Symposium on Programming, European
Joint
Conferences on Theory and Practice of Software
(Barcelona, Spain, June 2004), 249-263
Value-Based
Partial Redundancy Elimination
Thomas VanDrunen and Antony Hosking.
In Proceedings of the International Conference on Compiler
Construction,
European Joint Conferences on Theory and Practice of Software
(Barcelona, Spain, June 2004), 167-184
Penumbra:
Enhancing Eclipse for Introductory Programming
Frank Mueller. Master's Thesis, Purdue
University, May 2004.
Corner
Cases in Value-Based Partial Redundancy Elimination
Thomas VanDrunen and Antony Hosking.
Purdue University Computer Science Technical Report 03-032.
Penumbra:
An Eclipse plugin for introductory programming
Frank Mueller and Antony
Hosking.
In Proceedings of the 2003 OOPSLA workshop on Eclipse Technology
eXchange (eTX), Conference on Object-Oriented Programming Systems,
Languages, and Applications (Anaheim, California, October 2003),
65-68
On the
Usefulness of Liveness for Garbage Collection and Leak Detection
Martin Hirzel, Amer Diwan, and Antony
Hosking.
In Proceedings of the European Conference on Object Oriented
Programming (Budapest, Hungary, May 2001), 181-206
Partial
redundancy
elimination for access path expressions
Antony L. Hosking, Nathaniel Nystrom,
David Whitlock,
Quintin Cutts and Amer Diwan. Software - Practice and
Experience
31(6):577-600, 2001
A
Framework for
Persistence-Enabled Optimization of Java Object Stores
Persistence-enabled
optimization of Java programs
David Whitlock. Master's
Thesis, Purdue University,
May 2000.
Mostly-copying
reachability-based orthogonal persistence
Antony L. Hosking and Jiawan
Chen. In Proceedings
of the ACM International Conference on Object-Oriented Programming
Systems,
Languages and Applications (Denver, Colorado, November 1999). ACM
SIGPLAN
Notices 34(10), October 1999, 382-398.
PM3: An
Orthogonally Persistent Systems Programming Language - Design,
Implementation, Performance
Antony L. Hosking and Jiawan
Chen. In Proceedings
of the 25th International Conference on Very Large Data Bases
(Edinburgh,
Scotland, September 1999). Morgan Kaufmann, 1999. Read the
review of this paper in ACM
SIGMOD Digital Review.
Swizzle
barrier optimizations for orthogonal persistence in Java
Optimizing
the read and write barrier for orthogonal persistence
Reconciling
buffer management with persistence optimisations
Bytecode
Level Analysis and Optimization of Java Classes
Nathaniel Nystrom. Master's
Thesis, Purdue University,
August 1998.
Optimizing
Orthogonal Persistence for Java
Kumar Brahnmath. Master's
Thesis, Purdue University,
May 1998.
Reachability-Based
Orthogonal Persistence for C, C++ and Other Intransigents
Analysing,
Profiling
and Optimising Orthogonal Persistence for Java
Approaches
to Adding Persistence to Java
Residency
Check Elimination for Object-Oriented Persistent Languages
Lightweight
Write Detection and Checkpointing for Fine-Grained Persistence
Antony L. Hosking and J. Eliot B.
Moss. Submitted
for publication. Computer Sciences Technical Report 95-084,
Purdue
University.
Benchmarking
Persistent Programming Languages: Quantifying the Language/Database
Interface
Lightweight
Support for Fine-Grained Persistence on Stock Hardware
Expressing
Object Residency Optimizations Using Pointer Type Annotations
Remembered
Sets Can Also Play Cards
Protection
Traps and Alternatives for Memory Management of an Object-Oriented
Language
Object
Fault Handling for Persistent Programming Languages: A Performance
Evaluation
Update
Logging for Persistent Programming Languages: A Comparative Performance
Evaluation
A
Comparative Performance Evaluation of Write Barrier Implementations
Main
Memory Management for Persistence
Compiler
Support for Persistent Programming
Towards
Compile-Time Optimisations for Persistence
Design
of an Object Faulting Persistent Smalltalk
hosking@acm.org