Sciweavers

38 search results - page 6 / 8
» Runtime optimizations for a Java DSM implementation
Sort
View
PLDI
2000
ACM
13 years 12 months ago
Field analysis: getting useful and low-cost interprocedural information
We present a new limited form of interprocedural analysis called field analysis that can be used by a compiler to reduce the costs of modern language features such as objectorien...
Sanjay Ghemawat, Keith H. Randall, Daniel J. Scale...
TECS
2010
74views more  TECS 2010»
13 years 5 months ago
Recovering from distributable thread failures in distributed real-time Java
We consider the problem of recovering from failures of distributable threads (“threads”) in distributed realtime systems that operate under run-time uncertainties including th...
Edward Curley, Binoy Ravindran, Jonathan Stephen A...
COMPSAC
2009
IEEE
14 years 7 days ago
Towards a Next-Generation Matrix Library for Java
Matrices are essential in many fields of computer science, especially when large amounts of data must be handled efficiently. Despite this demand for matrix software, we were una...
Holger Arndt, Markus Bundschus, Andreas Naegele
PLDI
2010
ACM
14 years 18 days ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
VEE
2010
ACM
218views Virtualization» more  VEE 2010»
14 years 2 months ago
Improving compiler-runtime separation with XIR
Intense research on virtual machines has highlighted the need for flexible software architectures that allow quick evaluation of new design and implementation techniques. The inte...
Ben Titzer, Thomas Würthinger, Doug Simon, Ma...