4,199,811 A 4, 1980 Borgerson et al. 4,667,290 A* 5/1987 Goss et al.................. 717/147
4,910,731 A 3, 1990 Sakurai et al. 5,418,964 A 5, 1995 Conner et al. 5,815,718 A 9, 1998 …

Adaptive modifications of spinning and blocking behavior in spin-then-block mutual
exclusion include limiting spinning time to no more than the duration of a context Switch …

BACKGROUND In a multiprocessor environment With threads and preemp tive scheduling,
threads generally participate in a mutual exclusion protocol for synchronization purposes, for …

1. Field of the Invention This invention relates generally to computer program compiling, and
more speci? cally to loop unrolling optimi Zation in a dynamic compiling environment. 2 …

BACKGROUND 1. Field of Description The present description relates, in general, to
compilers and compilation methods, and, more particularly, to a com piler and compilation …

RUNTHE FIRST PORTION OF THE SLOW THREAD WITHINTHE CoMPUTERIZEd
SYSTEM, THE FIRST PORTION RECUESTINGA LOCK ON THE SHARE RESOURCE …

To efficient generate native processor code from operand stack based code, a mimic stack is
introduced. The mimic stack is a compile time data structure that stores the location of …

A virtual machine with a hybrid just-in-time compiler that enables execution of a set of cross-
platform code on a hardware platform. The hybrid just-in-time compiler consumes relatively …

5,163,139 A 1 1/1992 Haigh et al. 6,071,317 A 6/2000 Nagel 5,179,673 A* 1/1993 Steely et
al................... 71.2/239 6,075.940 A 6/2000 Gosling 5, 193,180 A 3/1993 Hastings 6,075,942 …

5,913,065* 6/1999 Faustini................. 77 generate native code that is executable by a
computer 5,943,496* 8/1999 Li et al............. 70932s System, from a program in Java Byte …