Filters








2,082 Hits in 6.9 sec

Implicit array bounds checking on 64-bit architectures

Chris Bentley, Scott A. Watterson, David K. Lowenthal, Barry Rountree
2006 ACM Transactions on Architecture and Code Optimization (TACO)  
Any array reference outside of its bounds will cause a protection violation; this provides implicit bounds checking.  ...  Several programming languages guarantee that array subscripts are checked to ensure they are within the bounds of the array.  ...  This achieves implicit bounds checking for all array references. While ICRs can be implemented on most modern architecture/operating systems, they are primarily intended for 64-bit machines.  ... 
doi:10.1145/1187976.1187982 fatcat:zgalfefotrhbzg6e5d7p223zpq

Effective sign extension elimination

Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatani
2002 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation - PLDI '02  
If such Java programs are executed on a 64-bit architecture, many 32-bit values must be sign-extended to 64-bit values for integer operations. This causes serious performance overhead.  ...  Computer designs are shifting from 32-bit architectures to 64-bit architectures, while most of the programs available today are still designed for 32-bit architectures.  ...  IA-64 has a 32-bit compare instruction to compare only the lower 32 bits of registers, so array bounds checking can be implemented with no sign extension. !  ... 
doi:10.1145/512529.512552 dblp:conf/pldi/KawahitoKN02 fatcat:3p7vvkcnqvaejkuvvxq4b545hy

Effective sign extension elimination

Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatani
2002 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation - PLDI '02  
If such Java programs are executed on a 64-bit architecture, many 32-bit values must be sign-extended to 64-bit values for integer operations. This causes serious performance overhead.  ...  Computer designs are shifting from 32-bit architectures to 64-bit architectures, while most of the programs available today are still designed for 32-bit architectures.  ...  IA-64 has a 32-bit compare instruction to compare only the lower 32 bits of registers, so array bounds checking can be implemented with no sign extension. !  ... 
doi:10.1145/512549.512552 fatcat:6lc4buubk5apfohjchlbmh4xp4

Effective sign extension elimination

Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatani
2002 SIGPLAN notices  
If such Java programs are executed on a 64-bit architecture, many 32-bit values must be sign-extended to 64-bit values for integer operations. This causes serious performance overhead.  ...  Computer designs are shifting from 32-bit architectures to 64-bit architectures, while most of the programs available today are still designed for 32-bit architectures.  ...  IA-64 has a 32-bit compare instruction to compare only the lower 32 bits of registers, so array bounds checking can be implemented with no sign extension. !  ... 
doi:10.1145/543552.512552 fatcat:oeohvwghhvajve23zynrmikiem

A Framework for Optimizing Java Using Attributes [chapter]

Patrice Pominville, Feng Qian, Raja Vallée-Rai, Laurie Hendren, Clark Verbrugge
2001 Lecture Notes in Computer Science  
We demonstrate the framework with attributes for elimination of array bounds and null pointer checks, and we provide experimental results for the Kaffe just-in-time compiler, and IBM's High Performance  ...  This paper presents a framework for supporting the optimization of Java programs using attributes in Java class files.  ...  An array element reference in Java needs to be guarded by both a null pointer check and an array bounds check on the array index ( [17] ).  ... 
doi:10.1007/3-540-45306-7_23 fatcat:huqfvbqsrvhdzbi4qdjkuxvm3e

A framework for optimizing Java using attributes

Patrice Pominville, Feng Qian, Raja Vallée-Rai, Laurie Hendren, Clark Verbrugge
2010 CASCON First Decade High Impact Papers on - CASCON '10  
We demonstrate the framework with attributes for elimination of array bounds and null pointer checks, and we provide experimental results for the Kaffe just-in-time compiler, and IBM's High Performance  ...  This paper presents a framework for supporting the optimization of Java programs using attributes in Java class files.  ...  An array element reference in Java needs to be guarded by both a null pointer check and an array bounds check on the array index ( [17] ).  ... 
doi:10.1145/1925805.1925819 fatcat:veuvgjopqjhr7mygfoi25mfucu

Effectiveness of cross-platform optimizations for a java just-in-time compiler

Kazuaki Ishizaki, Toshiaki Yasue, Takeshi Ogasawara, Tamiya Onodera, Hideaki Komatsu, Toshio Nakatani, Mikio Takeuchi, Kiyokuni Kawachiya, Toshio Suganuma, Osamu Gohda, Tatsushi Inagaki, Akira Koseki (+2 others)
2003 SIGPLAN notices  
including both 32-bit and 64-bit modes, CISC, RISC, and VLIW architectures.  ...  This paper describes the system overview of our Java Just-In-Time (JIT) compiler, which is the basis for the latest production version of IBM Java JIT compiler that supports a diversity of processor architectures  ...  ACKNOWLEDGEMENTS We would like to thank the IBM Software Group in Toronto for taking over and continuing the development and the services of the IBM Java JIT compiler.  ... 
doi:10.1145/949343.949322 fatcat:k3ufha22h5glfb2k2ecstxxcmy

Effectiveness of cross-platform optimizations for a java just-in-time compiler

Kazuaki Ishizaki, Toshiaki Yasue, Takeshi Ogasawara, Tamiya Onodera, Hideaki Komatsu, Toshio Nakatani, Mikio Takeuchi, Kiyokuni Kawachiya, Toshio Suganuma, Osamu Gohda, Tatsushi Inagaki, Akira Koseki (+2 others)
2003 Proceedings of the 18th ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications - OOPSLA '03  
including both 32-bit and 64-bit modes, CISC, RISC, and VLIW architectures.  ...  This paper describes the system overview of our Java Just-In-Time (JIT) compiler, which is the basis for the latest production version of IBM Java JIT compiler that supports a diversity of processor architectures  ...  ACKNOWLEDGEMENTS We would like to thank the IBM Software Group in Toronto for taking over and continuing the development and the services of the IBM Java JIT compiler.  ... 
doi:10.1145/949319.949322 fatcat:opdbaze4b5bfxg6ortd6cakzzq

Kava

David F. Bacon
2001 Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande - JGI '01  
The distinction is especially problematic when a particular programming community requires primitive-level support for a new data type, as for complex, intervals, fixed-point numbers, and so on.  ...  In Kava, there are no primitive types; instead, objectoriented programming is provided down to the level of single bits, and types such as int can be explicitly programmed within the language.  ...  In particular: the index type of enumeration-indexed arrays, and the value and bound attributes of declarations. All other safety checks should be handled implicitly by the Java type system.  ... 
doi:10.1145/376656.376812 fatcat:ugwwevda3rb5hibd26wodcxa2m

Kava: a Java dialect with a uniform object model for lightweight classes

David F. Bacon
2003 Concurrency and Computation  
The distinction is especially problematic when a particular programming community requires primitive-level support for a new data type, as for complex, intervals, fixed-point numbers, and so on.  ...  In Kava, there are no primitive types; instead, object-oriented programming is provided down to the level of single bits, and types such as int can be explicitly programmed within the language.  ...  work, to Philippe Charles for help with design and implementation in Jikes, and to Joe Darcy, Deepak Goyal, David Grove, William Kahan, Carlos Varela, John Vlissides, and the anonymous referees of the Java  ... 
doi:10.1002/cpe.653 fatcat:tb4c6akuxnfjvpae4ms6qpt7gm

JayHorn: A Framework for Verifying Java programs [chapter]

Temesghen Kahsai, Philipp Rümmer, Huascar Sanchez, Martin Schäf
2016 Lecture Notes in Computer Science  
On the back-end side, theorem provers start providing full-fledged model checking algorithms, such as PDR, that take care looping control-flow.  ...  We report on our implementation experience and evaluate JayHorn on benchmarks.  ...  Array abstraction. On the simplified input program, JayHorn performs one abstraction step to eliminate arrays.  ... 
doi:10.1007/978-3-319-41528-4_19 fatcat:ivhnjuevmjdmdaejybw6xumgqq

Cycles to recycle

Richard L. Hudson, J. Elliot Moss, Sreenivas Subramoney, Weldon Washburn
2000 Proceedings of the second international symposium on Memory management - ISMM '00  
The IA-64, Intel's 64-bit instruction set architecture, exhibits a number of interesting architectural features. Here we consider those features as they relate to supporting garbage collection (GC).  ...  While our focus is not on any particular GC implementation or programming language, we draw on our experience designing and implementing GC for the Intel Java Virtual Machine for the IA-64.  ...  Acknowledgments Many members of the Intel Java Virtual Machine group also worked in the implementation, including Michal Cierniak, Jesse Z.  ... 
doi:10.1145/362422.362470 dblp:conf/iwmm/HudsonMSW00 fatcat:l323frtlbzawlpaym5eitk5sqa

Cycles to recycle

Richard L. Hudson, J. Elliot Moss, Sreenivas Subramoney, Weldon Washburn
2001 SIGPLAN notices  
The IA-64, Intel's 64-bit instruction set architecture, exhibits a number of interesting architectural features. Here we consider those features as they relate to supporting garbage collection (GC).  ...  While our focus is not on any particular GC implementation or programming language, we draw on our experience designing and implementing GC for the Intel Java Virtual Machine for the IA-64.  ...  Acknowledgments Many members of the Intel Java Virtual Machine group also worked in the implementation, including Michal Cierniak, Jesse Z.  ... 
doi:10.1145/362426.362470 fatcat:yqbohd6dmrdvjnkvvry6pocihq

Lime

Joshua Auerbach, David F. Bacon, Perry Cheng, Rodric Rabbah
2010 Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '10  
We conclude with some initial results demonstrating applications running either on a CPU or coexecuting on a CPU and an FPGA.  ...  We present a new language, Lime, which is designed to be executable across a broad range of architectures, from FPGAs to conventional CPUs.  ...  The bit-width varies within the Feistel method so the bounds on the bit arrays vary greatly (64, 56, 48, 32, 28, 6, and 4) .  ... 
doi:10.1145/1869459.1869469 dblp:conf/oopsla/AuerbachBCR10 fatcat:4m5zpnhf4bg4je3mzs4q37xcta

Lime

Joshua Auerbach, David F. Bacon, Perry Cheng, Rodric Rabbah
2010 SIGPLAN notices  
We conclude with some initial results demonstrating applications running either on a CPU or coexecuting on a CPU and an FPGA.  ...  We present a new language, Lime, which is designed to be executable across a broad range of architectures, from FPGAs to conventional CPUs.  ...  The bit-width varies within the Feistel method so the bounds on the bit arrays vary greatly (64, 56, 48, 32, 28, 6, and 4) .  ... 
doi:10.1145/1932682.1869469 fatcat:dcwjknolubbv3lrmiqtzhiq43a
« Previous Showing results 1 — 15 out of 2,082 results