text:
|Publication number
|Publication type
|Application number
|Publication date
|Jun 10, 2003
|Filing date
|Jul 17, 1998
|Priority date
|Mar 24, 1998
|Fee status
|Publication number
|Phillip M. Adams
|Original Assignee
|Novell, Inc.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (28), Non-Patent Citations (9), Referenced by (23), Classifications (14), Legal Events (6)
|External Links: USPTO, USPTO Assignment, Espacenet
This appln claims benefit of Prov. No. 60/079,185 filed Mar. 23, 1998.
1. The Field of the Invention
The invention relates generally to computers hosting interpreted languages and emulators, and more specifically to accelerators for emulators and interpreters such as JAVA, Visual Basic, and other virtual machine environments executable by processors having access to caches.
2. The Background Art
Interpreters are nothing more than programs that "realize" some abstract machine's behavior. This is accomplished by having the program execute a series of instructions on the host machine that functionally represent the desired results of the specified interpretive instruction. This is a very useful technique if the desired interpretive program is required to execute on a large number of very different host machines, e.g, JAVA applets or Visual Basic programs.
There are, however potential problems with this approach. The most notable one is the lack of performance achieved by the interpretive program. This can be attributed to many factors. One of the most damaging of these factors is the potential mis-match between the byte-ordering of the abstract machine and the host machine.
In other words, if the abstract machine orders bytes from the least significant to the most significant (Little Endian) and the host machine orders bytes from the most significant to the least significant (Big Endian) then it is impossible for the interpreter to execute on the host machine in a montotonically increasing address fashion.
Interpreters are typically designed as a fixed set (number of interpretive instructions or bytecodes) of small interpretive routines. Each routine is designed to perform the function of the specified interpretive instruction (opcode or bytecode.) Associated with these routines is a control loop that has certain responsibilities. First it must fetch the next interpretive instruction (opcode or bytecode) from the loaded interpretive program's code space. This happens to be the interpreter's data space. Next, it will decode the interpretive instruction (opcode or bytecode) and select the interpretive routine that will perform this interpretive instruction's execution. Finally, it will execute the selected interpretive routine.
The above steps of the control loop are repeated until the interpretive program is finished or an error occurs in the program. This control loop should be minimized to achieve optimal performance. However, if the fetch and decode stages of the control loop must continually fetch and decode "out-of-order" bytes from the interpretive instruction stream due to a mis-match in byte ordering; then the overhead of the control loop becomes substantial and can easily be greater than the actual time required to execute the interpretive routine.
Operations executed by a processor of a computer proceed in a synchronization dictated by a system clock. Accordingly one characteristic of a processor is a clock speed. For example, a clock speed may be 33 megahertz, indicating that 33 million cycles per second occur in the controlling clock.
A processor may execute one instruction per clock cycle, less than one instruction per clock cycle, or more than one instruction per clock cycle. Multiple execution units, such as are contained in a Pentium™ processor, may be operated simultaneously. Accordingly, this simultaneous operation of multiple execution units, arithmetic logic units (ALU), may provide more than a single instruction execution during a single clock cycle.
In general, processing proceeds according to a clock's speed. Operations occur only as the clock advances from cycle to cycle. That is, operations occur as the clock cycles. In any computer, any number of processors may exist. Each processor may have its own clock. Thus, an arithmetic logic unit (ALU) may have a clock operating at one speed, while a bus interface unit may operate at another speed. Likewise, a bus itself may have a bus controller that operates at its own clock speed.
Whenever any operation occurs, a request for interaction is made by an element of a computer. Then, a transfer of information, setup of input/output devices, and setup of the state of any interfacing devices, must all occur.
Each controller of any hardware must operate within the speed or at the speed dictated by its clock. Thus, clock speed of a central processing unit does not dictate the speed of any operation of a device not totally controlled by that processor.
These devices must all interface with one another. The slowest speed will limit the performance of all interfacing elements. Moreover, each device must be placed in the state required to comply with a request passed between elements. Any device that requires another device to wait while some higher priority activity occurs, may delay an entire process.
For example, a request for an instruction or data within a hard drive, or even a main, random-access memory, associated with a computer, must negotiate across a main system bus. A central processing unit has a clock operating at one speed. The bus has a controller with a clock that may operate at another speed. The memory device has a memory management unit that may operate at another speed.
Further to the example, a Pentium™ processor having a clock speed of 100 megahertz may be connected to peripheral devices or main memory by an industry standard architecture (ISA) bus. The ISA bus has a specified clock speed of 8 megahertz. Thus, any time the Pentium™ processor operating at 100 megahertz requests data from the memory device, the request passes to the opposite side of the ISA bus. The data may not be processed or delivered at a speed greater than that of the bus at 8 megahertz. Moreover, a bus typically gives low priority to the central processing unit. In order to avoid underruns and overruns, the input/output devices receive priority over the processor. Thus, the 100 megahertz processor may be "put on hold" by the bus while other peripheral devices have their requests filled.
Any time a processor must access any device beyond its own hardware pins, the hardware interface to the computer outside the processor proper, the required task cannot be accomplished within one clock count of the processor. As a practical matter, a task is not usually completed in less than several clock cycles of the processor. Due to other priorities and the speeds of other devices, as well as the need to adjust or obtain the state configurations of interfacing devices, many clock cycles of a processor may occur before a task is completed as required. Thus, extra steps cost much more than may be expected.
In view of the foregoing, it is a primary object of the present invention to provide Endian correction at load time rather than at run time for increasing the execution speed of interpretive environments.
It is another object of the invention to provide programmatic control in a loader for testing and correcting endian-antithetical executables to be stored in a code cache.
It is another object of the invention to provide a test and response for all virtual machine instructions forming a virtual machine, in which each of the compiled or assembled, linked, and loaded native code segments implementing a virtual machine instruction is Endian neutral with respect to a host platform, and is ready to be executed by native instructions into which it is decodable readily with no checking or correction of endian orientation.
It is another object of the invention to provide a main memory device containing data structures adaptable to determine and selectively correct endian-dependent, mismatched addresses ready to be executed by a processor, without requiring run-time reordering of bytes in the main memory device upon retrieval of any virtual machine instruction.
Consistent with the foregoing objects, and in accordance with the invention as embodied and broadly described herein, an apparatus and method are disclosed in one embodiment of the present invention as including a central processing unit (CPU) having an operably associated memory and processor cache for storing code to be transmitted.
The foregoing problems are resolved by resolving the mismatch in byte ordering in the interpretive instruction stream during load time. Simply stated, the interpretive instruction stream is recorded, if necessary, to conform with the byte ordering of the host machine. Since the interpretive instruction stream is execute-only (read only) there is no danger in disrupting the byte ordering of the execution.
The technique significantly improves performance of interpretive environments such as JAVA, while executing interpretively in INTEL x86 processors. For example, JAVA's virtual (abstract) machine defines 38 opcodes (bytecodes) that have 16-bit/32-bit operands. JAVA's virtual (abstract) machine includes a WIDE instruction that produces another 12 of these instructions-Totaling 50 instructions. Typical 16-bit run-time code used to resolve byte-ordering mismatch require 5 separate machine instructions. Sample 16-bit run-time employed in accordance with the invention requires a single instruction even with 32-bit addressing.
This indicates that interpretive run-time execution overhead can be reduced to one-fifth for these instructions. Furthermore, these instructions are high-use instructions which have a significant impact on overall execution. These instructions include about a quarter of all instructions, but approximately half of all executions, since these instructions are used almost twice as often as average instructions.
The implementation of the invention requires little or no loading overhead. In the case of JAVA, the classes are already inspected at load time. At this point, the byte ordering is resolved with no additional overhead required.
Much interest has been focused over decades on virtual machines. Nevertheless, the slow performance (compared to native code processing) of virtual machines has largely counter-balanced the platform-independent benefits associated therewith.
However, specific knowledge may exist with respect to a particular environment. To take better advantage of interpreted environments generally, such as virtual machines, an apparatus and method in accordance with the invention may rely on this knowledge of the execution environment for a virtual machine in order to optimize the use of the virtual machine instructions. Knowing in advance that certain instructions will definitely be required, much faster execution speeds may be obtained by preparing operands corresponding to those instructions in proper endian order.
For example, in one embodiment, an apparatus and method in accordance with the invention a loader may test and correct endian-antithetical instructions to provide a full set of virtual machine instructions, properly compiled or assembled, linked, and loaded in memory.
The foregoing and other objects and features of the present invention will become more fully apparent from the following description and appended claims, taken in conjunction with the accompanying drawings. Understanding that these drawings depict only typical embodiments of the invention and are, therefore, not to be considered limiting of its scope, the invention will be described with additional specificity and detail through use of the accompanying drawings in which:
FIG. 1 is a schematic block diagram of an apparatus in accordance with the invention;
FIG. 2 is a schematic block diagram showing implementation details for one embodiment of the apparatus of FIG. 1;
FIG. 3 is a schematic block diagram of executable modules and data structures consistent with one implementation of an apparatus and method in accordance with the invention;
FIG. 4 is a schematic block diagram of registers used for addressing;
FIG. 5 is a schematic block diagram of run-time code endians.
FIGS. 6-7, are schematic block diagrams comparing respective shares are occupied by dynamic opcodes during execution by the processor of FIG. 1;
FIG. 8 is a schematic block diagram of processes programmed into a virtual machine instruction for handling endian-antithetical operands;
FIGS. 9-10 are representations of run-time byte ordering codes illustrating a process executed by the processor to correct antithetical operands; and
FIG. 11 illustrates endian-neutral, run-time codes.
FIGS. 12-13 diagrams associated comparative execution times with endian antithetical and endian neutral codes;
FIG. 14 is a schematic block diagram of an endian-correction process in a loader;
FIGS. 15-18 are schematic block diagrams of stored data structures and the loader adapted to effect endian-neutral correction of addressed associated with opcodes.
It will be readily understood that the components of the present invention, as generally described and illustrated in the Figures herein, could be arranged and designed in a wide variety of different configurations. Thus, the following more detailed description of the embodiments of the system and method of the present invention, as represented in FIGS. 1 through 18, is not intended to limit the scope of the invention, as claimed, but it is merely representative of the presently preferred embodiments of the invention.
The presently preferred embodiments of the invention will be best understood by reference to the drawings, wherein like parts are designated by like numerals throughout.
Those of ordinary skill in the art will, of course, appreciate that various modifications to the details illustrated in the schematic diagrams of FIGS. 1-18 may easily be made without departing from the essential characteristics of the invention. Thus, the following description is intended only as an example, and simply illustrates one presently preferred embodiment consistent with the invention as claimed herein.
Referring now to FIGS. 1-3, and more particularly, an apparatus 10 may include a node 11 (client 11, computer 11) containing a processor 12 or CPU 12. The CPU 12 may be operably connected to a memory device 14. A memory device 14 may include one or more devices such as a hard drive or non-volatile storage device 16, a read-only memory 18 (ROM) and a random access (and usually volatile) memory 20 (RAM).
The apparatus 10 may include an input device 22 for receiving inputs from a user or another device. Similarly, an output device 24 may be provided within the node 11, or accessible within the apparatus 10. A network card 26 (interface card) or port 28 may be provided for connecting to outside devices, such as the network 30.
Internally, a bus 32 (system bus 32) may operably interconnect the processor 12, memory devices 14, input devices 22, output devices 24, network card 26 and port 28. The bus 32 may be thought of as a data carrier. As such, the bus 32 may be embodied in numerous configurations. Wire, fiber optic line, wireless electromagnetic communications by visible light, infrared, and radio frequencies may likewise be implemented as appropriate for the bus 32 and the network 30.
Input devices 22 may include one or more physical embodiments. For example, a keyboard 34 may be used for interaction with the user, as may a mouse 36. A touch screen 38, a telephone 39, or simply a telephone line 39, may be used for communication with other devices, with a user, or the like. Similarly, a scanner 40 may be used to receive graphical inputs which may or may not be translated to other character formats. A hard drive 41 or other memory device 14 may be used as an input device whether resident within the node 11 or some other node 52 (e.g., 52 a, 52 b, etc.) on the network 30, or from another network 50.
Output devices 24 may likewise include one or more physical hardware units. For example, in general, the port 28 may be used to accept inputs and send outputs from the node 11. Nevertheless, a monitor 42 may provide outputs to a user for feedback during a process, or for assisting two-way communication between the processor 12 and a user. A printer 44 or a hard drive 46 may be used for outputting information as output devices 24.
In general, a network 30 to which a node 11 connects may, in turn, be connected through a router 48 to another network 50. In general, two nodes 11, 52 may be on a network 30, adjoining networks 30, 50, or may be separated by multiple routers 48 and multiple networks 50 as individual nodes 11, 52 on an internetwork. The individual nodes 52 (e.g. 52 a, 52 b, 52 c, 52 d) may have various communication capabilities.
In certain embodiments, a minimum of logical capability may be available in any node 52. Note that any of the individual nodes 52 a- 52 d may be referred to, as may all together, as a node 52.
A network 30 may include one or more servers 54. Servers may be used to manage, store, communicate, transfer, access, update, and the like, any number of files for a network 30. Typically, a server 54 may be accessed by all nodes 11, 52 on a network 30. Nevertheless, other special functions, including communications, applications, and the like may be implemented by an individual server 54 or multiple servers 54.
In general, a node 11 may need to communicate over a network 30 with a server 54, a router 48, or nodes 52. Similarly, a node 11 may need to communicate over another network (50) in an internetwork connection with some remote node 52. Likewise, individual components 12-46 may need to communicate data with one another. A communication link may exist, in general, between any pair of devices.
Referring now to FIG. 2, a processor 12 may include several internal elements. Connected to the bus 32, a bus interface unit 56 handles the bus protocols enabling the processor 12 to communicate to other devices over the bus 32. For example, the instructions or data received from a ROM 18 or data read from or written to the RAM 20 may pass through the bus interface unit 56.
In some processors, a processor cache (e.g. cache 58,64), such as a level-1 cache 58 may be integrated into the processor 12. In specific embodiments of processors 12, such as the Pentium™ and Pentium™ Pro processors, as well as the PowerPC™ by Motorola, the level-1 cache 58 may be optionally subdivided into an instruction cache 60 and a data cache 62.
A level-1 cache 58 is not required in a processor 12. Moreover, segregation of the instruction cache 60 from the data cache 62 is not required. However, a level-1 cache 58 provides rapid access to instructions and data without resort to the main memory 18, 20 (RAM 20). Thus, the processor 12 need not access (cross) the bus interface unit 56 to obtain cached instructions and data.
Certain processors 12 maintain an external cache 64. The external cache 64 is identified as a level-2 cache in FIG. 2. Nevertheless, the level-2 cache 64 may be a level-1 cache if no level-1 cache 58 is present on the processor 12 directly. Similarly, the external cache 64 may or may not be segregated between an instruction cache 66 and a data cache 68. Any suitable processor cache may be used.
Execution, normally associated with a processor 12, is actually most closely related to a fetch/decode unit 70, an execute unit 72, and a writeback unit 74. Likewise, associated with each cache 58, 64, is typically an inherent, integrated, hardware controller. The cache controller may be thought of as control logic built into the cache hardware.
When the fetch unit 71 a issues a request for an instruction, the request goes to the bus interface unit 56. The level-1 cache 58 makes a determination whether or not the request can be satisfied by data or instructions identified with the logical address requested from cached data and instructions.
If an instruction cannot be provided by the level-1 cache 58, the level-2 cache 64 may respond to the request. If the desired item (data or instruction) is not present in either the level-1 cache 58 or the level-2 cache 64, then the main memory 18, 20 may respond with the desired item. Once the request has been fulfilled by the fastest unit 58, 64, 20, 18 to respond with the desired item, the request is completed, and no other devices will respond.
Main memory may include the ROM 18, the RAM 20, or both. Nevertheless, many computers boot up using the contents of the ROM 18 and thereafter use the RAM 20 for temporary storage of data associated with applications and the operating system. Whenever "main memory" is mentioned, it is contemplated that it may include any combination of the ROM 18 and RAM 20.
Once an instruction is retrieved for the fetch unit 71 a, the instruction is passed to the decode unit 71 b. The fetch 71 a and decode 71 b are typically highly integrated, and perform in an overlapped fashion. Accordingly, a fetch/decode unit 70 is typical.
As a practical matter, the decode unit 71 b may identify a current instruction to be executed. Identification may involve identification of what type of instruction, what type of addressing, what registers will be involved, and the like. The presence of the instruction in an instruction register, may itself stimulate execution on the next clock count.
Once identification of an instruction is completed by the decode unit 71 b, an execute unit 72 may immediately process the instruction through low-level, control-loop hardware. For example, sequencers, registers, and arithmetic logic units may be included in an execute unit 72.
Each instruction as it is fetched, decoded, executed, and the like, may require interaction between an individual processing unit 70, 72, 74 and a register pool 76. The registers 76 (register pool 76) are hidden from programmers and applications. Nevertheless, the hardware architecture of the processor 12 provides a hardware logic governing interaction between the units 70, 72, 74 and between the registers 76 and the units, 70, 72, 74.
Upon completion of execution of an instruction, a writeback unit 74 may provide an output. Accordingly, the output may be passed to the bus interface unit 56 to be stored as appropriate. As a practical matter, a result may be stored in a cache 58 of a level-1 variety or in a level-2 cache 64. In either event, a writeback unit 74 will typically write through to the main memory 18, 20 an image of the result.
Modern processors 12, particularly the Pentium™ processors, use a technique called pipelining. Pipelining passes an instruction through each of the fetch/decode/execute steps undergone by that instruction as quickly as possible. An individual instruction is not passed completely through all of its processing steps before the next instruction in order is begun.
For example, a first instruction may be fetched, and on the next clock count another instruction may be fetched while the first instruction is being decoded. Thus, a certain parallel, although slightly offset in time, processing occurs for instructions.
An advantage of a method and apparatus in accordance with the invention is that instructions may be more effectively pipelined. That is, prediction routines have been built into hardware in the Pentium™ class of processors 12. However, prediction is problematic. Inasmuch as a branch may occur, within approximately every five machine code instructions on average, the pipeline of instructions will be in error periodically. Depending on the sophistication of a prediction methodology, one or more instructions in a pipeline may be flushed after entering a pipeline at the fetch unit 71 a.
Referring now to FIG. 3, a virtual machine 90 or an instruction set 90 implementing a virtual machine 90 on a processor 12 is illustrated schematically. Relationships are illustrated for caching 80 or a cache system 80 for storing loaded and executable instructions 106 (e.g. 106 a) corresponding to virtual machine instructions 91 (e.g. 91 a) of a virtual machine 90 or virtual machine instruction set 90.
A virtual machine 90 may be built upon any available programming environment. Such virtual machines 90 may sometimes be referred to as interpreters, or interpreted systems. Alternatively, virtual machines 90 are sometimes referred to as emulators, wherein a set of instructions 91 a-n may be hosted on a processor 12 of one type to mimic or emulate the functional characteristics of a processor 12 in a hardware device of any other type.
An application may be written to run on or in an environment created for a first hardware device. After the application is fully developed and operational, the application may then be "ported" to another machine. Porting may simply include writing a virtual machine 90 for the second hardware platform. Alternatively, an application may be developed in the native language of a first machine, and a single set 90 of virtual machine instructions 91 a-n may be created to emulate the first machine on a second machine. A virtual machine 90 is sometimes referred to as an emulation layer. Thus, an emulation layer or virtual machine 90 may provide an environment so that an application may be platform-independent. A JAVA interpreter, for example, performs such a function.
An executable 82 loaded into main memory 18, 20 contains the original images of the contents of the cache system 80. A building system 84 that may be thought of as an apparatus, modules running on an apparatus, or a system of steps to be performed by an apparatus, is responsible to build contents to be loaded into the executable 82.
A builder 86 may be tasked with building and loading an executable image 100 of a virtual machine 90. Similarly, a builder 88 may build an executable image 130 of the instructions 106 implementing an application written in the virtual machine instructions 91 constituting the virtual machine 90. In general, the executable 130 or executable image 130 may represent any application ready to be executed by the execute unit 72 of the processor 12. One embodiment of an executable 130 or an image 130 may be an application written specifically to prompt a high speed loading as described with respect to FIG. 4 below.
A virtual machine 90 or a set 90 of virtual machine instructions 91 a-n may contain an individual instruction (e.g. 91 a, 91 b, 91 n) corresponding to each specific, unique function that must be accommodated by the virtual machine 90. The virtual machine instruction 91 n, for example, provides the ability to terminate execution.
In FIG. 3, the builder 86 may include source code 90, virtual machine source code 90. The source code 90 may be assembled or compiled by an assembler 92 or compiler 92, as appropriate. The virtual machine may operate adequately, whether dependent on assembly or compilation. The assembler 92 or compiler 92 operates for native code. Native code, may be thought of as code executable directly on a processor 12 in the apparatus 10.
By native code is indicated the processor-specific instructions 91 that may be executed directly by a processor 12. By directly is not necessarily meant that the native code is always written in binary ones and zeros. Native code 106 may be written in a language to be assembled 92 or compiled 92 into object code 94 and to be eventually linked 96 into an executable 100 loaded for execution. Executables 100 may then be loaded 99 into a memory device 20, 18 for ready execution on or by an execute unit 72 of a processor 12. An executable 100 stored in a non-volatile storage device 16 may sometimes be referred to as an executable file. Once properly loaded 99 into the main memory 18, 20 associated with a processor 12 an executable 100 may be executed by a processor 12.
The assembler 92 or compiler 92 provides object code 94 in native code instructions. The object code 94 may be linked to library routines or the like by a linker 96. The linker 96 may provide all other supporting instructions necessary to run the object code 94. Thus, the linker 96 provides, as output, executable code 98. As a practical matter, the executable code 98 will be run directly from main memory 18, 20 as a loaded executable 100. Thus, a loader 99 may load the executable code 98 into main memory 18, 20 as the loaded code 100.
Code segments 106 a-n are written in native code. When any code segment 106 a-n (e.g. 106 a, 106 b, 106 c, 106 n) is executed, the result is the desired output from the corresponding virtual machine instruction 91 a-n (e.g. 91 a, 91 b, 91 c, 91 n, respectively). Virtual machine instructions 91 a-n identify every available function that may be performed by the virtual machine 90. The instructions 106 a-n illustrate segments 106 a-n, implementations in native code, executably the hardware, processor 12, that must produce the result associated with each individual virtual machine instruction 91 a-n.
Each of the code segments 106 a-n contains a FETCH instruction 108 DECODE instruction 110 and JUMP instruction 112. The instructions 108-112 promote pipelining. Thus, the subject of each of the respective instructions decode 110, fetch 108, and JUMP 112 correspond to the very next instruction, the second next instruction, and the third next instruction, respectively, following an instruction 91 a-n being executed and corresponding to a code segment 106 a-n in question.
A virtual machine instruction set 90 should include a HALT instruction 91 n. Thus, a virtual machine instruction 91 n within the virtual machine 90 will contain a segment 106 n of native code indicating to the processor 12 the fetching and decoding process for instructions used in all applications. The last virtual machine instruction 91 a-n contained within a loaded application 130 is a HALT instruction 91 n (106 n).
In FIG. 3, the loaded executable 100 may be stored in a block 114 separated by block boundaries 116. In the Pentium™ class of processors, each block 114 contains 32 bytes of data. The instruction set 90 or virtual machine 90 contains no more than 256 virtual machine instructions 91 a-n . Accordingly, the code segments 106 a-n, when compiled, linked, and loaded, may each be loaded by the loader 99 to begin at a block boundary 116, in one currently preferred embodiment. Thus, the number of blocks 114 and the size of each block 114 may be configured to correspond to a cache line 140 in the cache 60. Thus, an image of a code segment 106 a-n, compiled, linked, and loaded for each virtual machine instruction 91 a-n, exists in a single cache line 140. Likewise, every such virtual machine instruction 91 a-n and its native code segment 106 a-n has an addressable, tagged, cache line 140 available in the 256 cache lines.
In addition to the builder 86, a builder 88 may build any virtual machine application 120. In FIG. 3, the process of building an application 120 is illustrated. For example, a mock application may be constructed for the exclusive purposes of high-speed loading of the code segments 106 into the cache lines 140. In the embodiment shown, virtual machine source language code 120 or source code 120 may be written to contain instructions 91 arranged in any particular order. In general, instructions 91 are used by a programmer in any suitable order to provide and execute an application 120.
In an embodiment of an apparatus and method in accordance with the invention, the source code 120 may simply contain each of the virtual machine instructions 91 in the virtual machine language. The source code 120 may be assembled or compiled by an assembler 122 or compiler 122 depending on whether the language is an assembled or a compiled language. The assembler 122 or compiler 122 generates (emits, outputs) virtual machine code. The output of the assembler 122 or compiler 122 is object code 124. The object code 124 may be linked by a linker 126 to produce an executable code 128. The executable code 128 may be loaded by a loader 129 into main memory 18, 20 as the loaded executable 130.
The loaded executable 130 is still in virtual machine code. Thus, an application developed in the virtual machine language must be run on a virtual machine. The virtual machine 90 is stored in the cache 60. The cache 60 may actually be thought of as any processor cache, but the closest cache to a processor 12, is capable of the fastest performance.
The loaded executable 130 is comprised of assembled or compiled, linked, and loaded, virtual machine instructions 132. A main memory device 20 is byte addressable. Each of the virtual machine instructions 132 begins at an address 134. Thus, each virtual machine instruction 132 may be of any suitable length required. Nevertheless, a virtual machine address zero 135 may be identified by a pointer as the zero position in the virtual machine 130. Each subsequent address 134 may thus be identified as an offset from the virtual machine zero 135. A last instruction 136 should be effective to provide an exit from the loaded executable 130. Typically, loaded executables 130 are executed in the order they are stored in the memory device 20.
The cache 60 has associated therewith a tag table 142. For each cache line 140, an appropriate tag line 144 exists (e.g. 144 a, 144 b, 144 c). Associated with each tag line 144, is a logical address 146 corresponding to the address 134 of the cache line 140 in question. Likewise, a physical address 148 in a tag line 144 corresponds to an address 116 or block boundary 116 at which the code 114 is stored in the main memory 18, 20. A control field 144 c may contain symbols or parameters identifying access rights, and the like for each cache line 140.
Thus, in general, a loaded executable 130 (application 130) has a logical address 134 associated with each virtual machine instruction 132. The logical address 134 associated with the beginning of an instruction 132 is bound by the tag table 142 to the physical address 116 associated with the executable code 100 associated with the corresponding code segment 106 whose compiled, linked, and loaded image is stored at the respective cache line 140 associated with the tag line 144 binding the logical address 134, 146 to the physical address 116, 148.
In one currently preferred embodiment of an apparatus and method in accordance with the invention, the virtual machine instruction set 100 is written so that each block 114 contains a single instruction 91. Moreover, the instruction set 90 is written to occupy exactly the number of cache lines 140 available in the cache 60.
In certain embodiments, an individual instruction 91 may occupy more than a single cache line 140. For example, some caches may have a 16 byte line length. Thus, a 32 byte length for an instruction 91 may require two cache lines 140. In one presently preferred embodiment, a number of cache lines 140 may correspond exactly to the number of blocks 114 required to hold all of the instructions 91, such that each instruction 91 may be addressed by referring to a unique cache line 140.
The cache 60 may be pinned or fenced, and yet continue to operate normally, otherwise. Thus, the controller of the cache 60 will continue to refer to the tag table 142 to determine whether or not an address 146, 148 requested is present. In the case of a virtual machine 90, every instruction 91 may be present in the cache 60. Thus, the tag table 142 will contain the code 106 associated with any address 146, 148 representing any virtual machine instruction 91.
Less than a full set of instructions 91 may be loaded into a cache 60. Alternatively, for a cache 60 having more cache lines 140 than needed for storing a virtual machine 90 in its entirety, unused cache lines 140 may be devoted to other code, loaded in a similar way. Code may be selected according to recency of use, cost/benefit analysis of use, or cost/benefit analysis of retrieval from main memory 18, 20.
The cache 60 is used by way of example. The virtual machine 90 will operate fastest by using the cache 60 closest to the fetch/decode unit 70. Alternatively, another cache 64 may be used. Thus, everything describing the cache 60 may be applied to the cache 66 or the cache 64 so far as loading and pinning of the cache 60 are concerned.
Referring to FIG. 4, an efficient fetch/decode/JUMP algorithm may begin with an XOR of the contents of a register EAX 180 against itself. The effect of the XOR is to zero out the contents of the EAX register 180. The contents of register EAX 180 may represent a pointer. Following this clearing operation, a MOVE instruction (MOV) may move the contents of a memory location corresponding to a pointer (next logical instruction number) and identified by the label or logical instruction number stored in a register EBX 190 into the register AL 186.
The register AL 186 is the lower eight bits of the AX register 182. The AX register 182 is the lower 16 bits of a 32 bit EAX register 180. The upper eight bits of the AX register 182 constitute the AH register 184. The AL 186 or lower register 186 thus receives the contents of a memory location corresponding to a current instruction 91 being pointed at by the contents of the EBX 190 register.
Following the MOVE instruction, a SHIFT instruction may shift left by five bits (effectively a multiplication by a value of 32) the contents of the EAX register 180. Since the EAX register 180 was zeroed out, and only the AL register was filled, a shift left of the EAX register 186 multiplies its value by 32. This shift left is effectively a decoding of the instruction that was fetched by the MOVE instruction.
Continuing with the procedure, a JUMP instruction may be implemented to position EAX in the set of virtual machine instructions. Note that each virtual machine instruction 91 in the complete set 90, when loaded, is written within the same number of bytes (32 bytes for the native code segment implementing the virtual machine instruction). The code segment 106 for each instruction 91 begins at a block boundary 116 and at the beginning of a cache line 140. Thus, a virtual machine instruction number multiplied by 32 will step through each of the native code segments 106. Thus, a JUMP to EAX constitutes a direct addressing of the native code segment 106 required to implement a particular virtual machine instruction 91.
Other mechanisms exist to address memory 20. For example, vector tables are commonly used. However, such mechanisms require certain calculations to occur in order to execute a JUMP. Moreover, memory access is required in order to complete the determination of a value in a vector table. Thus, the processor 12 must request access to the main memory 18, 20 in order to fulfill the request for a vector table entry. Accessing main memory 20 and other operations requiring requests to be managed by the bus 32 may increase access times by more than orders of magnitude. The simple arithmetic logic unit operation of a JUMP in the preferred embodiment, is much more efficient than the vector table approach that imposes a memory reference on top of a simple JUMP operation.
Referring to FIG. 5, a comparison of run-time code instructions 198, alternative endians 198, is illustrated. In the illustration, a little endian 200 compares with a big endian 210.
In general, run-time code 100 typically contains an opcode 212 or bytecode 212 effective to be executed as an interpreter instruction 91 by the execute unit 72 in the processor 12. The opcode 212 is the instruction to be interpreted by the virtual machine 90, to be processed by the execute unit 72, and is sometimes referred to as the executable 212 in a processing instruction 198.
Associated with an opcode 212 may be an operand 214. Opcodes 212 may operate without any operational data 214 or operands 214. However, in any language, several of the opcodes 212 available will permit or require addresses 214 as operands 214. The address 214 points to a location for finding the data that the opcode 212 will operate on.
Typically, an opcode 212 is contained within a single byte 218 of code. The byte order 216 or the byte or byte numbers 216 may be arranged in either a little endian 200 or big endian 210 format. In the byte ordering 216, an nth byte 218 contains the opcode 212. The n+1st byte 220 follows the opcode 212 (e.g. opcode 230 in a little endian 200). Thereafter, subsequent bytes 222, 224, 226, are arranged in order of significance (ascending for a little endian 200, descending for a big endian 210).
Each operand 214 or address 214 need not contain the entire four bytes 220, 226. Addresses 214 may be 16-bit or 32-bit in Pentium processors 12. In a little endian 200, the n+1byte 220 is the least significant byte 228. The n+2nd byte 222 is the next and more significant, byte 232. Likewise, the n+3rd byte 224 is the next and more significant, byte 234. Finally, the last byte 226 or n+4th byte 226 is the most significant byte 236.
The address 214 of a little endian 200 or big endian 210 may be a 16-bit, and thus, 2 bytes, or 32-bits and 4 bytes 220. Thus, a little endian 200 contains an opcode 230 followed by the address 214 with all bytes 228-236 arranged in ascending order from the least significant byte 228 to the most significant byte 236.
A big endian 210 contains a leading opcode 240 also. However, in a big endian 210, the most significant byte 238 is arranged as the first address byte 220, or the n+1st byte 220 in the address 214. Likewise, the next most significant byte 242 is arranged as the n+2nd byte 222. The following byte 224 or n+3rd byte 224 is the next most significant byte 244 in descending order. Finally, the least significant byte 246 occupies the n+4th byte 226 of the address 214.
Thus, the processor 12 will read a little endian 200 to interpret the last byte 226 in a 32-bit address 214 as the most significant byte 236. The first byte 220 will be read as the least significant byte 228. By contrast, the processor 12 operating on a big endian 240 will interpret the first byte 220 after the opcode 218 as containing the most significant byte 238, with the least significant bye 246 following in the last byte location 226 for a 32-bit address 214, and following immediately in the next byte 222 after the first byte 220 in a 16-bit address 214.
Referring to FIG. 6, the typical dynamic use of opcodes 212 is illustrated according to the distribution of such use within a processor 12. The dynamic use distribution 250 involves different instructions 198, each of which may be called multiple times. As with any physical machine, a computer program 130 does not use each component part or instruction 198 the same number of times. Thus, although, for example, endian-dependent instructions 198 provide about 25 percent of all individual instructions 91, certain lines 114 may be used more often than others. Accordingly, it is useful to discuss the dynamic use distribution 250 of the instructions 198.
The dynamic use 250 includes a proportion of branches 252 or branching functions 252. Typical branching functions 252 may include IF commands, GOTO commands and the like. Branches account for approximately 20 percent of all instructions 106 associated with programmed instructions 132 actually executed in a program 130.
Loads and stores 254 account for approximately 40 percent of all executions 106 for instructions 132. For example a PUT, PUSH, GET, or the like constitutes an instruction 106 in the class of loads and stores 254. Approximately 40 percent of all instructions 106 involve loads and stores 254.
Arithmetical and logical operations 256 provide approximately 20 percent of all executed instructions 106, thus typical operations of multiplication, subtraction, division, logical comparisons and so forth, and Boolean algebra, are included in the arithmetical and logical operations 256. Arithmetical and logical operations 256 are endian independent. Miscellaneous operations 258 make up the remainder of the dynamic use distribution 250 of instructions 132 in a program 130.
Approximately 10 to 15 percent of the miscellaneous instructions 258 are endian-dependent. That is, endian-independent instructions 106, 198 will not contain addresses 214 that depend on whether they are little endians 200 or big endians 210. Thus, the arithmetical and logical operations 256 are endian-independent, while approximately 10 to 15 percent of the miscellaneous instructions 258 or miscellaneous executions 258 of instructions 132 are endian-independent.
All the branches 252 are endian-dependent. Of the loads and stores 254, perhaps a quarter or 25 percent will be affected by the endians 200, 210. Thus, endian-specific or endian-dependent loads and stores 254 will constitute about 10 percent of all dynamic use 250 of instructions 132.
The significance of the orientation of endians 200, 210 is the actual processing effect in the execute unit 72 and the fetch/decode unit 70 in the processor 12. In a processor 12 that is designed to interpret instructions 198 as little endians 200, a little endian 200 is executed directly, with no manipulation of the bytes 228-236. By contrast, a processor 12 designed to interpret an instruction 198 as a little endian 200, a big endian 210 must be arranged to place the least significant byte 246 at the first byte position 220, the most significant byte 238 in the last byte position 226, and so forth.
The manipulation of the bytes 238-246 among the byte locations 220-226, occupies a certain number of machine level instructions 106 in each virtual machine instruction 91. As a practical matter, in a 16-bit machine, an instruction 198 requiring rearrangement between a little endian 200 and big endian 210 format or between a big endian 210 and a little endian format 200 may occupy 5 times as many machine level instructions 106. A 32-bit instruction 198, when requiring re-ordering between a little endian format 200 and a big endian format 210, or between a big endian format 210 and a little endian format 200, may occupy ten times as many machine level instructions 106.
Thus, the branches 252 occupy a disproportionate share of the time of the processor 12. Similarly, that portion of the loads and stores 254 that are endian-specific, or endian-dependent require a disproportionate share of processing time on the processor 12. Likewise, the fraction of the miscellaneous instructions 258 that are endian-specific, and thus endian-dependent as to their processing time, it will occupy a disproportionate share of the processing time.
As a practical matter, the actual distribution of static code 106 or instructions 91 in a virtual machine 90 may be compared with the actual dynamic use distribution 250 of those individual instructions 91 invoked by the program instruction 132 illustrating the great disparity in processing time in the processor 12. Thus, the individual fractions 252, 254, 256, 258 are not representative of the occupation of the processor 12. Approximately 30 percent of all dynamic use distribution 250 will be endian-dependent instructions 198.
Referring to FIG. 7, a static code distribution 260 illustrates the proportion of all the instructions 250 that are endian-sensitive 262. The endian-sensitive opcodes 262 or endian-specific opcodes 262 occur approximately 25 percent of the time in an instruction set 90 of a virtual machine. By contrast, the non-endian sensitive opcodes 264 occur approximately 75 percent of the time in a machine language, but maybe half the codes executed in a virtual machine 90. Note that the static code distribution 260 does not reflect the number of times that a particular opcode 218 will actually be called. Certain instructions 191, 198 are called more often for instructions 106, or as a result of instructions 132 in a program 130 invoking interpretive instructions 91.
The call distribution 261 or execution distribution 261 is illustrated in FIG. 7. One may note that the endian-sensitive calls 266 or endian-specific calls 266, also referred as endian-sensitive executions 266 or endian-antithetical executions 266, are called approximately half the time in a program 130. Note that endian orientation is not an issue for a processor 12 receiving an instruction 132 configured with an endian 198 consistent with the expectations of the processor 12. The issue of little endian 200 and big endian 210 processing in a processor 12 is the presence of antithetical endians 266 operating in a processor 12.
For example, each of the virtual machine instructions 91 in native code 106 must operate 5 or 10 times longer, or execute 5 or 10 time more processing steps 106 in order to re-order the improper endian 198. Thus, the antithetical executions 266 identify those situations in which the bytes 228-336 or bytes 238-246 must be rearranged following the respective opcodes 230, 240, respectively. Non-endian-sensitive calls 261 or executions 261 are considered to be endian-neutral 268. As a practical, approximately half of all executions 261 are endian-neutral 268 and half are endian antithetical 266.
Referring to FIG. 8, a virtual machine instruction 91 j, among several virtual machine instructions 91 i, 91 j, 91 k of a virtual machine 90, is illustrated. The virtual machine native code 106 or interpretation 106 with its terminal fetch 108, decode 110, and jump 112 as illustrated in FIG. 3 is shown. The portion 274 of the virtual machine instruction 91 j is executed in every case where a program 130, or rather an instruction 132 in a program 130, calls a virtual machine instruction 91. In an endian-neutral instruction 91, the substantive portion 294 may be the entire virtual machine instruction 91.
By contrast, an endian-specific instruction 262 requires the endian correction module 270 within the virtual machine instruction 91 j. The portion 272 of the virtual machine instruction 91 j is time-consuming manipulation of the improper endians 200, 210. Note that although the little endian 200 and big endian 210 identify the entire instructions lines 200, 210, respectively, the endians 200, 210 actually refer may be used to the address bytes 214 alone. Accordingly, an endian antithetical instruction 266 requires the additional processing step on an endian correction module 270.
Referring to FIG. 9, typical byte-ordering, run-time code 270 is illustrated for a virtual machine instruction 91 requiring 4-byte addressing 214 or operands 214. Referring to FIGS. 9-11 generally, a comparison may be made between the byte-ordering, run-time code for a virtual machine instruction 91 having 2-byte addresses or operands 214. FIGS. 9-10 refer to endian antithetical instructions 266. By contrast, FIG. 11 refers to endian-neutral, run-time code.
The endian correction 270 comprising opcodes 212 and addresses 214 in FIGS. 9-10 illustrate that a 16-bit or 2-byte address 214 requires five instructions to execute the endian correction 270. A 4-byte or 32-bit address 214 requires ten instructions. By contrast, an endian-neutral, run-time code example, corresponding to the endian-correction 270 and native code 106 of FIG. 8, requires a single instruction 276, 278.
To accomplish the same result as the endian correction 270 and code 106 of FIG. 9, a 32-bit endian-neutral, run-time code 278 requires a single instruction 278 in the example. Similarly, to accomplish the same result as the five instructions 212 of FIG. 10, a 16-bit endian-neutral, run-time code 276 requires a single instruction 276. The instructions 276, 278 are those that would be expected by an endian-neutral instruction 132 in which the endian-correction module 270 is not required. The typical codes 270, 280 illustrate the dramatic difference in processing time resulting from having to make endian-corrections 270. The codes of FIGS. 9-11 include both the endian-correction 270 and the substantive effect 106 of the instruction 91 j or the example illustrated.
Referring to FIG. 12, the execution time 282 is illustrated for an endian-antithetical execution 266. The execution time 282 is dependent upon the number 284 of non-endian-sensitive opcodes 264 or endian-neutral opcodes 264 multiplied by the number of executions 106 required for each. Also, the execution time 282 is dependent upon the total number 288 of endian-sensitive opcodes 266, or actually the endian-antithetical opcode executions 266 that must be re-ordered.
The number 288 of re-ordered opcodes 266 executed is multiplied by a weight 290 reflecting the difference in the endian-correction module 270 and the individual endian-neutral codes 276, 278 that would be required. The weight 286 is unity, reflecting the appropriate run-time code 276, 278 for a 16-bit or a 32-bit endian 198, 214, respectively. By contrast, the weight 290 corresponds to the five-fold or ten-fold increase in the number of instructions 106 required to accommodate the endian-correction module 270 as well as the substantive instruction (opcode 218) constituting the substantive portion 274 of the virtual machine instruction 91.
The processing time 292 indicates the amount of processor time, usually measured in terms of clock cycles, required by the processor 12 to execute each opcode 212. Thus, the number 284 of endian-neutral executions 268, multiplied by a weight 286 corresponding to a clock-cycle count of unity (regardless of whether one or two clock cycles is required for each instruction, one may think of this as a base-line execution) added to the number 288 of re-ordered opcodes 212 to be executed, multiplied by their respective weights 290, form a multiplicand for the processing time 292. This product indicates the number of clock cycles required for executing a singe instruction 212, 198.
The ratio 294 of endian-neutral executions 268 to the number 288 of endian-antithetical executions 266 is typically one. That is, N 284 is the same as M 288. Meanwhile, the individual weight 296 for a 16-bit, endian-antithetical execution 266 has a value of about 5. Likewise, the weight 298 corresponding to a 32-bit, endian-antithetical 266 has a value of about 10, as illustrated in FIGS. 10, 9, respectively.
The weight 290 corresponding to an endian-sensitive execution 266, when executed on a processor 12 oriented with the proper endian 198, becomes the same as the weight 286 for endian-neutral executions 268. In such a case one may think of the number 288 being added into the number 284, or the number 288 equaling the number 284, with the weight 290 equaling the weight 286. The effect of an apparatus and method in accordance with the invention, implementing endian-neutral instructions 276, 278 in lieu of the endian-antithetical executions 266 is to render a weight 290 effectively equal to the weight 286 of unity for endian-insensitive executions 268.
Referring to FIG. 13, the result of the execution time 282 of FIG. 12 is illustrated. In one embodiment of an apparatus and method in accordance with the invention, and endian-corrected loading 300 is performed by the loader 129. The endian-corrected loading 300 effectively re-orders the bytes 228-336 or bytes 238-246 at load time. The loader 129 loading the virtual machine instructions 132 of the program 130 makes a determination regarding the endian orientation of each of the instructions 198 and the orientation of the processor 12. At loading, the loader 129 re-orients or re-orders the addresses 214 or operands 214 associated with endian-sensitive opcodes 266. Thus, all endian-sensitive opcodes 262 may be executed as endian-insensitive executions 268.
The endian-antithetical processing time 302 is contrasted with the fully endian-neutral, processing time 304. For example, in FIG. 13, the endian-antithetical processing 302 includes time 306 associated with endian-antithetical executions 266 of 16-bit operands 214. The time 306 required, of the total processing time 302 is ⅚ of the total processing time 302. This reflects the number of instructions 212 required in FIG. 10. The time 308, 310, together, totals the remaining endian-neutral processing executions 268.
The time 308, in combination with the time 306 reflects the total endian-antithetical processing executions 266 for a 32-bit operand 214. Note that the total processing time 302 for endian-antithetical processing 302 is actually considerably greater, and is illustrated here by way of a ratio, for a 32-bit execution time 308. The execution time 308 may be thought of as pertaining to the endian-neutral processing time 310 for the 16-bit case, and the time 308 may be seen as encompassing all of the time fraction 306 in a 32-bit case. Thus, the endian-antithetical processing time 302 reflects the equation for execution time 282 of FIG. 12.
The time 306 is very disproportionate to the time 310, even thought the number 284 corresponding to the time 310 is the same as the number 288 corresponding to the time 306. The difference, is that the weight 286 corresponding to the time 310 is considerably less than the weight 290 associated with the processing time 306.
Similarly, for 32-bit case, the weight 290 is even more disproportionate to the weight 286, although the number 284 is the same as the number 288 in this case as well. As a practical matter, the weight 290 actually reflects the individual executions 106 within the processor 12, rather than the number of instructions reflected by the numbers 284, 288. The time 314 represents the portion 314 of the time 302 that is saved by the endian-corrected loading 300.
Thus, the endian-neutral processing time 304 actually includes only the endian-neutral time 310. The execution time saved 314 represents a reduction of the weight 290 of FIG. 12 to a value of 1, thus, the endian-neutral processing time of the endian-neutral processing arrangement 304 is double the endian-neutral processing time 310 of the endian-antithetical processing time 302.
The total weight 316 corresponding to endian-antithetical processing 302 for a 16-bit address 314, and the total, execution-time weight 318 for 32-bit addresses 214 are accommodated in total weights 320. The value 322 of the weights 316, 318 are 6 and 11 respectively, as illustrated in FIGS. 7-13. A reduction 323 for each of the 69-bit and 32-bit cases is illustrated. Approximately half of the executions 261 occupying approximately 83 or 91 percent of the processing 302 are reduced to the same endian-neutral time 310 as the endian-insensitive instructions 268. The resulting total weights 316, 318 of 2 and 2, respectively, rather than values of total weights 316, 318 of 6 and 11, respectively. The results of the reductions 323 in the total weights 320 can approximately triple or quintuple the speed at which instructions 132 are processed by the processor 12.
Referring to FIG. 14, a loader 129, implements a load-time correction 330 of operands 214 replacing the endian-correction module 270 of FIG. 8. In FIG. 14, a loader 129 may obtain 324 operand endian data indicating the ordering of operands 214. Similarly, the loader 129 may be provided, or otherwise obtain 324, platform-endian data corresponding to the orientation of the processor 12 and the execution for ordering of endians 198. The loader 129 may compare 328 the endian contexts of the endian data 324, 326 corresponding to the operands 214, and the processor 12, respectively.
Not all opcodes 212 are endian-sensitive 264. A test 332 may determine whether a particular opcode 212 is endian antithetical 332. To the extent, that an opcode 212 is endian-insensitive 264, resulting in an endian-neutral execution 268, the operand 214 is irrelevant. If a positive response to the test 332 occurs, then a byte-switching step 334 may reverse the order of the respective address 214 of the offensive endian 198. The loader 129 thus reorients or re-orders those addresses 214 in endians 198 that would result in endian-antithetical executions 266.
To the extent that the test 332 returns a negative response, the loader 229 may bypass 336 the byte-switching step 334. That is, if an operand 214 is endian-insensitive 264, resulting in endian-neutral execution 268, no point is served by considering the operand 214. To the extent that an opcode 218 contains no operand 214, no processing is required of the loader 129 to manipulate absent operands 214.
The endian correction module 330 in the loader 129 performs the function in lieu of the endian-correction module 270 in a virtual machine instruction 91 herein. Otherwise, the virtual machine instruction 91 must execute the endian-correction module 270 for every single endian-sensitive opcode 266 that may occur during processing 261. The disproportionate number 266 of calls to the endian-sensitive opcodes 262 churn the code of virtual machine instructions 91 through the processor 12 in such a case. In an apparatus and method in accordance with the invention, the byte-switching 334 in response to the comparison 328 change the endian-orientation 200, 210 of the static code distribution 260, rendering the endian-sensitive opcodes 262 endian-insensitive 264. All executions 261 are then endian-neutral executions 268. Alternatively, one may think of the endian-antithetical executions 266 as being rendered to have a weight 290 having a value of unity.
Having re-ordered the endians 198 as needed, the loader 129 may then proceed to load 338 into the memory 20 the opcode 212 and associated operand 214. Thereafter, no virtual machine instruction 91 need use an endian-correction module 270. Instead, an endian-correction module 330 executed by a loader 129, at one time solved the problem for every execution of each endian-sensitive opcode 262. That one time is at load time only.
Referring to FIGS. 15-18, endian-neutral loading 340 is illustrated in various configurations. For example, in FIG. 15, a virtual machine 128 that is operating for native big-endians 240 is destined for execution according to a program 130 in memory 20 that is oriented for little endians 200. Accordingly, the memory 20 must receive the opcode 240 followed by the least significant byte 246 and ranging to the most significant byte 238, beginning at a low value of the memory 20. The most significant byte 220 in the operand 214, down to the least significant byte 226 are improperly ordered. Accordingly, the loader 129 may invoke an endian-correction module 330 followed by a load 338 into memory 20 eliminating the problem.
Referring to FIG. 16, a virtual machine 128 is oriented for a big endian 210 in which an opcode 240 has an address 214 with the most significant byte 220, first consistent with the requirements of the instruction 132 in memory 20. Accordingly, the program 130 requires no correction by the endian-correction module 330. Instead, the test 332 in the engine correction module 330 of the loader 129 will bypass 336 any correction of the operands 214.
Referring to FIG. 17, a virtual machine 128 is oriented for a little endian 200, while the arrangement of the memory 20 for the program 130 is expecting a big endian 210. Accordingly, the instruction 132 in memory 20 must be oppositely oriented, from the address 214 of the virtual machine 128. Accordingly, the endian correction module of the loader 129 performs byte-switching 334 on the address 214. Thus, the opcode 230 is first, followed by the most significant byte 236 and subsequent bytes 234, 232 down to a least significant byte 228. The program 130 is then loaded by the loader 129 in a load step 338 into the memory 20. Accordingly, when the instruction 132 is read as data out of memory 20 and has applied to it the vertical machine instructions 91 in the processor 12, no endian-correction module 270 is required in any virtual machine instruction 91.
Referring to FIG. 18, the virtual machine 128 of FIG. 17 is illustrated with the least significant byte 328 first, following the opcode 230. The address 214 is thus ordered precisely as required by the instruction 132 in the program 130 stored in memory 20. Since the opcode 230 is already followed by the least significant byte 228 up to the most significant byte 236, as required, ranging from a low value to a high value of the memory 20, the endian-correction module 330 executes a bypass 336. That is, the test 332 indicates that the endian data obtained 324 and corresponding to the instruction 212 in the virtual machine 128, when compared 328, to the data obtained 328 to correspond to the processor 12, results in a negative response to the test 332 and bypass 336 in the endian-correction module 330 of the loader 129.
One may see that all processing becomes endian-neutral 268. All executions 261 become endian-neutral executions 268, with inordinate wasted time 314 becoming saved time 314 in the endian-neutral processing 304, in accordance with the invention. This contrasts to the endian-antithetical processing 302, wherein approximately 60 to 80 percent of the execution time 282 may be wasted. Churning instructions 130, 198 through the byte-ordering, run-time codes 270, is replaced by the endian-neutral run-time codes 280 of the examples of FIGS. 8-11. Thus, the endian-correction module 270 in each virtual machine instruction 91, so effective, is obviated and may be eliminated by the endian-correction module 330 in a loader 129.
The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described embodiments are to be considered in all respects only as illustrative, and not restrictive. The scope of the invention is, therefore, indicated by the appended claims, rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.
|Cited Patent
|Filing date
|Publication date
|Oct 23, 1978
|Jul 7, 1981
|Collins Robert W
|Synchronizing mechanism for page replacement control
|Oct 8, 1982
|Apr 15, 1986
|International Business Machines Corporation
|Roll mode for cached data storage
|Dec 12, 1986
|Mar 7, 1989
|Intergraph Corporation
|Instruction execution accelerator for a pipelined digital machine with virtual memory
|Aug 3, 1987
|May 15, 1990
|Compag Computer Corporation
|Software emulation of bank-switched memory using a virtual DOS monitor and paged memory management
|Feb 22, 1988
|Jun 11, 1991
|International Business Machines Corp.
|Store queue for a tightly coupled multiple processor configuration with two-level cache buffer storage
|Feb 27, 1991
|Apr 13, 1993
|Sun Microsystems, Inc.
|Method and apparatus for cost-based heuristic instruction scheduling
|Jul 15, 1991
|Aug 17, 1993
|Quarterdeck Office Systems, Inc.
|Memory management method
|Aug 30, 1991
|Dec 28, 1993
|Intel Corporation
|Transparent system interrupts with integrated extended memory addressing
|Mar 24, 1992
|May 17, 1994
|Texas Instruments Incorporated
|Color palette device having big/little endian interfacing, systems and methods
|Sep 28, 1990
|Jun 28, 1994
|Tandon Corporation
|Computer system including a write protection circuit for preventing illegal write operations and a write poster with improved memory
|Oct 28, 1991
|Dec 6, 1994
|International Business Machines Corporation
|Method and apparatus for controlling operation of a cache memory during an interrupt
|Dec 24, 1991
|Feb 28, 1995
|International Business Machines Corporation
|Data processing system and method having selectable scheduler
|Apr 1, 1993
|May 9, 1995
|Intel Corporation
|Method and apparatus for sharing a common routine stored in a single virtual machine with other virtual machines operating in a preemptive muli-tasking computer system
|Nov 13, 1991
|Aug 29, 1995
|Texas Instruments Incorporated
|Flexible graphics interface device switch selectable big and little endian modes, systems and methods
|Oct 30, 1992
|Nov 28, 1995
|Digital Equipment Corporation
|Combined write-operand queue and read-after-write dependency scoreboard
|Dec 29, 1993
|May 14, 1996
|Intel Corporation
|Method and apparatus for loading a segment register in a microprocessor capable of operating in multiple modes
|Jul 15, 1992
|Sep 3, 1996
|International Business Machines Corporation
|System for synchronizing execution by a processing element of threads within a process using a state indicator
|Apr 15, 1994
|Sep 10, 1996
|Intel Corporation
|Write back cache coherency module for systems with a write through cache supporting bus
|Jun 6, 1995
|Jul 22, 1997
|International Business Machines Corporation
|System and method for increasing cache efficiency through optimized data allocation
|Mar 20, 1996
|Jul 29, 1997
|Digital Equipment Corporation
|Alternate execution and interpretation of computer program having code at unknown locations due to transfer instructions having computed destination addresses
|Jun 7, 1995
|May 19, 1998
|International Business Machines Corporation
|Parallel processing system having asynchronous SIMD processing
|Jun 30, 1995
|Jul 7, 1998
|Thomson Consumer Electronics, Inc.
|Apparatus for delivering CPU independent data for little and big endian machines
|Mar 18, 1996
|Jul 14, 1998
|Advanced Micro Devices, Inc.
|CPU with DSP having decoder that detects and converts instruction sequences intended to perform DSP function into DSP function identifier
|Dec 16, 1996
|Mar 30, 1999
|Novell Inc.
|Accelerator for interpretive environments
|Aug 5, 1996
|Feb 1, 2000
|General Magic, Inc.
|Object code structure and method for translation of architecture independent program implementations
|Dec 15, 1997
|Mar 21, 2000
|Motorola, Inc.
|Computer instruction which generates multiple results of different data types to improve software emulation
|Jul 17, 1998
|Oct 31, 2000
|Novell, Inc.
|Burst-loading of instructions into processor cache by execution of linked jump instructions embedded in cache line size blocks
|Aug 4, 1997
|Feb 12, 1998
|General Magic, Inc.
|Low-level endian-independent machine language program representation
|"Bit Operations with C Macros", John Rogers, Dr. Dobbs, Nov. 1995.*
|"Dual On-Chip Instruction Cache Organization in High Speed Processors, " IBM Technical Disclosure Bulletin, vol. 37, No. 12, pp. 213-214 (Dec. 1994).
|"Endian Issues", William Stallings, Byte Articles, "WWW.byte.com/art/9509/sec12/art1.htm" Sep. 1995.*
|"Endian-Neutral Software Part 1", James R. Gillig, Dr. Dobbs Journal, v19,n11,p62 ISSN 1044-789X, Oct. 1994.*
|"Endian-Neutral Software Part 2", James R. Gillig, Dr. Dobbs Journal, v19,n13,p44 ISSN 1044-789X, Nov. 1994.*
|"Hewlett-Parckard Works On a Cross Platform Strategy For Its Tools and System Software", Newswire, Jun. 1997.*
|"Instruction Cache Block Touch Retro-Fitted onto Microprocessor," IBM Technical Disclosure Bulletin, vol. 38, No. 07 pp. 53-56 (Jul. 1995).
|"Your Own Endian Engine", John Rodgers, Dr. Dobbs, v20,n11,pp. 30-36 ISSN1044-789X, Nov. 1995.*
|Preemptible Cache Line Prefecth Algorithm and Implementation, IBM Technical Disclosure Bulletin, vol. 33, No. 3B, pp. 371-373 (Aug. 1990).
|Citing Patent
|Filing date
|Publication date
|Nov 7, 2000
|Jun 21, 2005
|Arm Limited
|Data processing with native and interpreted program instruction words
|Oct 16, 2001
|Aug 9, 2005
|Stmicroelectronics Limited
|Bi-endian libraries
|Jun 27, 2003
|Feb 19, 2008
|Samsung Electronics Co., Ltd.
|Computer system providing endian information and method of data transmission thereof
|Dec 29, 2003
|Oct 7, 2008
|Transitive Limited
|Method and apparatus for performing native binding to execute native code
|Dec 13, 2004
|Jun 23, 2009
|Intel Corporation
|Method and apparatus for implementing a bi-endian capable compiler
|Aug 30, 2005
|Apr 20, 2010
|Virtutech Ab
|Interpreter for executing computer programs and method for collecting statistics
|Jun 3, 2005
|Jan 4, 2011
|Apple Inc.
|Typed-data translation for platform independence
|Nov 24, 2010
|Jul 24, 2012
|Apple Inc.
|Typed-data translation for platform independence
|May 11, 2009
|Oct 14, 2014
|Intel Corporation
|Method and apparatus for implementing a bi-endian capable compiler
|Jun 25, 2009
|Dec 9, 2014
|Intel Corporation
|Optimizing code using a bi-endian compiler
|Jun 24, 2013
|Aug 18, 2015
|Western Digital Technologies, Inc.
|Cross-platform software framework for embedded systems on data storage device
|Dec 26, 2000
|May 17, 2001
|Chikara Yoshida
|Link apparatus and virtual machine
|Oct 29, 2002
|May 1, 2003
|Tetsuyuki Kobayashi
|Intermediate code execution system, intermediate code execution method, and computer program product for executing intermediate code
|Jun 27, 2003
|Aug 5, 2004
|Jeong-Ju Lee
|Computer system providing endian information and method of data transmission thereof
|Dec 29, 2003
|Jan 20, 2005
|Alex Brown
|Method and apparatus for performing native binding
|May 11, 2009
|Sep 3, 2009
|Adiletta Matthew J
|Method and apparatus for implementing a bi-endian capable compiler
|Jun 9, 2011
|Apple Inc.
|Typed-Data Translation for Platform Independence
|Dec 9, 2005
|Jan 2, 2013
|Method and apparatus for implementing a bi-endian capable compiler
|Aug 2, 2010
|Dec 15, 2010
|Central processing unit and method for storing data thereof
|Aug 2, 2010
|Sep 11, 2013
|Central processing unit and method for storing data thereof
|Jun 25, 2009
|May 2, 2012
|Intel Corporation
|Optimizing code using a bi-endian compiler
|Sep 16, 2004
|Apr 28, 2005
|Live Media Pty Ltd
|A computep, system and methods therefor
|Dec 9, 2005
|Jun 22, 2006
|Intel Corporation
|Method and apparatus for implementing a bi-endian capable compiler
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|Jul 17, 1998
Owner name: NOVELL, INC., UTAH
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ADAMS, PHILLIP M.;REEL/FRAME:009332/0547
Effective date: 19980716
|Dec 11, 2006
|Fee payment
Year of fee payment: 4
|Dec 10, 2010
|Fee payment
Year of fee payment: 8
|Oct 31, 2011
Effective date: 20110427
Owner name: CPTN HOLDINGS LLC, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NOVELL, INC.;REEL/FRAME:027147/0151
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CPTN HOLDINGS LLC;REEL/FRAME:027147/0396
Effective date: 20110909
Owner name: ORACLE INTERNATIONAL CORPORATION, CALIFORNIA
|Feb 27, 2012
Owner name: CPTN HOLDINGS LLC, CALIFORNIA
Effective date: 20110427
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NOVELL, INC.;REEL/FRAME:027769/0057
Effective date: 20110909
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CPTN HOLDINGS LLC;REEL/FRAME:027769/0111
Owner name: ORACLE INTERNATIONAL CORPORATION, CALIFORNIA
|Nov 13, 2014
|Fee payment
Year of fee payment: 12


text:
StartUpHire is the place to find New Product Introduction (NPI) Engineer jobs. Review the list of New Product Introduction (NPI) Engineer career opportunities to the left. These New Product Introduction (NPI) Engineer jobs represent some of the most rewarding careers available.
You can refine your job search for New Product Introduction (NPI) Engineer career opportunities by adding a job title, company name, or keyword to the search box above … or click the "Advanced Search" link for more options.
Don't see the employment opportunity you're looking for? Check back soon for more New Product Introduction (NPI) Engineer jobs, or sign up for an email alert (link below) to receive periodic updates on new New Product Introduction (NPI) Engineer jobs.
The Product Engineering group drives NPI (New Product Introduction) activities with associated costs, schedule, and performance to enable next-generation product realization at nLIGHT. The preferred candidate will be highly motivated with an excelle7/21/2016 Vancouver, WA Save This Job
nLIGHT is searching for a Mechanical Engineer to work within and/or drive a multidisciplinary team to design, document and test stable, high tolerance laser and optical assemblies, define user interfaces and overall system layouts.7/28/2016 Vancouver, WA Save This Job
DEPARTMENT Engineering CITY Los Angeles, CA TYPE Full-Time What you?ll do As a Senior Product Quality Engineer you will be responsible for driving the execution of quality goals and objectives with a strong emphasis on New Product Introduction (NPI). The ability to leverage6/19/2016 Los Angeles, CA Save This Job
Customer Support Sunnyvale, California Description About Ruckus Wireless, Inc. Headquartered in Silicon Valley, Ruckus Wireless is a supplier of advanced wireless systems for the explosive mobile Internetworking market. The company markets and manufactures a wide range of6/11/2016 Sunnyvale, CA Save This Job
Job Code : 1293 Division : 1210 - New Product Introduction Location : SynQor Worldwide Headquarters, Boxborough MA US 01719-1316 % of Travel Required : None Job Type : Full Time Career Level : Entry Level Shift/Hours : First Shift (Day) Education : Bachelor's Degree Category :6/2/2016 Boxborough, MA Save This Job

subset: commoncrawl


text:
July 20, 2009: P.O.S. & the Jayhawks
Twin Cities News:
-- Cinemax has a two-part video featuring P.O.S. from its Max Tour Stories series: part 1 | part 2.
-- Twin Cities Hip Hop looks at McNally Smith's hip hop program.
-- Empty's Tapes has audio from Ice Palace at the Triple Rock.
-- MinnScene has a review of the National at First Ave.
-- The Current has audio of the Jayhawks in the radio's studio.
Local Concert Highlights:
-- Christopher O'Riley @ Dakota Jazz Club
Christopher O'Riley: (Official) (MySpace) (Wikipedia)
-- Reverend Horton Heat & Nekromantix @ First Avenue
Reverend Horton Heat: (Official) (MySpace) (Wikipedia)
Nekromantix: (Official) (MySpace) (Wikipedia)
Daily Audio Downloads:
-- The Cave Singers "Beach House" (mp3)
-- The Heaven Seventies "I Wanna Fuck (All Night Long)" (mp3)
-- How I Became The Bomb "Mothership" (mp3)
-- ¡MAYDAY! "Technology" (mp3)
-- David Mead "Blackberry Winters" (mp3)
-- David Mead "Rainy Weather Friend" (mp3)
-- Mellowdrone "Elephant" (mp3)
Get the Music Newsletter
Keep your thumb on the local music scene each week with music news, trends, artist interviews and concert listings. We'll also send you special ticket offers and music deals.
In Case You Missed It
Popular Stories
Sponsor Content


text:
Every month, we highlight the most interesting discussions online of what we modestly call the oDesk Experience. Our favorite writers receive free oDesk T-shirts, which are so ridiculously fabulous, we don't have words. (Send us links to your oDesk-related posts, and you might win one yourself.) Since our last check-in, there have been quite a few interesting blog entries about oDesk.
Our favorite? Student, runway model, and new oDesk provider Paulette Quinto's blog post describing her first three weeks on oDesk. It's just one of several posts about her oDesk adventures. We're assuming she's really gonna know how to wear that stylish black T-shirt…
We run across an awful lot of blog posts about the life of a provider—Katrine Sales provides a great one here—but this month we've got a fine piece for the buyers out there—headlined "How to Hire a Virtual Assistant," it provides a lot of tips about how to hire a remote provider to take over all that clutter that keeps you from doing what you need to get done. It's a fast-growing niche in our marketplace, so check out the tips and get on board now!
If you've been buzy buzzing too maybe you'll be featured here on the oDesk blog next month! Send us your links for a shot at those T-shirts—they're so cool, even models are wearing them now.


text:
Have you registered? | Introduction | Discussion Documents
Dear SARD Forum E-Colleagues,
As your E-Team, we extend a warm welcome to you. We look to you for your insights and experiences in the coming weeks to make the SARD E-Forum a worthwhile and successful event leading up to the World Summit on Sustainable Development. We would like to use this opportunity to provide some background information including the purpose, overall agenda, and details about the logistics of the SARD E-Forum.
What is the purpose of the SARD E-Forum?
Why these three themes?
How are we defining Sustainable Agriculture and Rural Development?
Further, the NGO Treaty on Sustainable Agriculture in Rio de Janeiro defines sustainable agriculture as a model of social and economic organization based on an equitable and participatory vision of development that recognizes the environment and natural resources as the foundation of economic activity. Agriculture is sustainable when it is ecologically sound, economically viable, socially just, culturally appropriate, human and based on a holistic scientific approach.
Who will participate in the SARD E-Forum?
How will the SARD E-Forum work?
The SARD E-FORUM will also use a web based message system for active discussion of the three thematic areas. Your moderators will post relevant documents and provide initial questions within each theme for the development of topical threads upon which to build the discussion on the web site. Participants can register for one or more thematic discussions on the web. The SARD E-Forum will also use the global listserv (SARD-EFORUM-L) for communications and information exchange across all thematic areas. On the listserv questions will be posed for each thematic area as well as summaries of the intensive sessions. For those who do not have easy access to the web, interventions posted to the global listserv will be incorporated into web based discussions and subsequent summaries. You will receive the introductory messages and questions for the first intensive for each thematic area on this listserv.
To enter the web based discussion, please click here to enter the discussions.
[An additional note from the Moderators on the format: We realize that using web based and e-mail communications does not encourage the participation of individuals and groups that do not have access to electronic media. We regret this and are looking for mechanisms to enhance discussion beyond the electronic arena. Until then, we ask that if you have the capacity to share this discussion with those who do not have access to email, it will be greatly appreciated. ]
What is the timeline for the discussion?
Who are some of the individuals behind the E-Forum Team?
Additional notes on logistics:
You will soon be receiving emails with specific information about the substantive dialogue. Please stay tuned and thank you for your interest and participation in the SARD E-Forum.
Our best wishes,


text:
Volume 91 Issue 20 | p. 18 | Concentrates
Issue Date: May 20, 2013
Issue Date: May 20, 2013
Ranbaxy To Pay Large Settlement
Department: Business
Keywords: consent decree, GMP, manufacturing, generic drugs
Keywords: consent decree, GMP, manufacturing, generic drugs
In the largest-ever fine levied against a generic drug manufacturer, Ranbaxy will pay $500 million to settle criminal and civil claims by the U.S. Department of Justice that it knowingly manufactured substandard drugs. In addition to the fine, Ranbaxy pled guilty to felony counts and to . . .
You Do Not Have Access to C&EN Protected Content.
- Chemical & Engineering News
- Copyright © American Chemical Society


text:
COLLEGE STATION, Texas -- The 2014 State 7-on-7 Tournament returned to College Station Thursday. Division two pool play got underway at 1:00pm. Three area teams were in action.
Navasota began the tournament with a 46-19 win over Quanah. The Rattlers then knocked off Rice Consolidated 48-7. Navasota closed out pool play with a 35-25 win over Abilene Wylie. The Rattlers won Pool P to advance to the championship bracket. Navasota will face Pilot Point Friday morning at 9:00am.
Crockett will join Navasota in the championship bracket. The Bulldogs won Pool F with a 2-1 record. Crockett beat Argyle 26-22 and Dublin 40-27. The Bulldogs' only loss was to Sealy 20-18. Crockett will face Booker Friday morning at 9:00am.
Rockdale is headed to the consolation bracket after going 1-2 in Pool I. The Tigers beat Marion 34-27 but then lost to Canton 33-27 and Brownwood 44-25. Rockdale will face Lorena Friday morning at 8:00am.
Division one pool play will begin Friday afternoon. A&M Consolidated will face Arlington Seguin at 1:00pm. College Station will take on El Paso Franklin at 2:00pm. Montgomery will play Creekview at 2:00pm.


text:
Contact Information
Clarke Hall
Virginia Wesleyan College
1584 Wesleyan Drive
Norfolk , VA 23502
Phone: 757.455.3359
Fax: 757.233.8743
M - Th
8:30 a.m.- 8:30 p.m.
8:30 a.m.- 4:30 p.m.
Student Research Projects
Comparative study of cosmetid harvestmen from the genera Eupoecilaema and Meterginus (Opiliones, Laniatores) from Central America
|Richard Page '14
|Faculty Mentor(s)
|Biology 489: Research Methods in the Natural Sciences
The taxonomy of Central American species of cosmetid harvestmen remains locked in a relative unresolved state, with most genera still defined by relatively few, superficial somatic characters. In this study, I examined adult males and females representing seven species for the genera Eupoecilaema and Meterginus, including specimens of four described and three undescribed species. My investigation included a comparison of fifty two morphological characters. Structure that exhibited interspecific variation included armature and shape of the dorsal scutum along with the tubercles on the femur of the pedipap, and armature of the chelicerae. The meristic data that I collected in this project will be combined with previously collected morphometric data as well as characters derived from SEM-based examinations of genitalia to re-describe current taxa and formally describe several new species.


text:
Bibi Wan vs. Darth Obama [video]Monday, March 2nd, 2015
Jew Wars: Episode 7 – Revenge of the White HouseJewish Press News Briefs
Jew Wars: Episode 7 – Revenge of the White HouseJewish Press News Briefs
Polls that showing that Eli Yishai's Yachad party won't pass the minimum electoral threshold. Neither will Michael Ben-Ari's Otzma Yehudit party. As a result, they could lose at least 4 seats that could have gone towards a right-wing coalition.
But joined together, the two are not only more likely to get in, but could possibly get as many as 7 seats.
But it comes at a cost.
Bayit Yehudi drops from 15 or 16 in the polls to 13 seats. Shas will also take a hit and drop back down to 6, after rallying this past week.
While Bayit Yehudi will take a small hit, in the big picture, Bayit Yehudi and Yachad would then bring 20 seats to the coalition, not 15 – assuming Naftali Bennett agrees to work with them after the elections.
It's clear that neither the Yachad nor the Otzma party chiefs plans to step down for the greater good and ensure Bayit Yehudi gets their otherwise lost votes, so the only sane option left is for them is to join together for the elections.
The question is, will their ideological handcuffs allow them to do the right thing?Jewish Press News Briefs
I'm going to recommend Velcro or sticky strips to Minister of Economy Naftali Bennett. He's always checking to see if his Kipa fell off.
In the photo are President of Israel, Ruby Rivlin (L) and Minister of Economy Naftali Bennett (R) during a "Outstanding Exporter" prize award ceremony held at the President's residence in Jerusalem on December 24, 2014.
With elections approaching, we'll soon see Bennett again in the President's office, next time offering his recommendation for Prime Minister. But it's also not so far-fetched that we may see Rivlin giving Bennett the chance to put the next coalition together.Photo of the Day
Virtually every Knesset party went wild Monday to claw the coalition government to near-death, leaving enough oxygen for resuscitation before forcing elections that, if held, should focus on blaming all the beasts for leaving their cages.
Israel's establishment media, especially the center-left electronic and print outlets, always use a day of quiet from riots and rocket attacks to whip up the winds to blow apart the collation headed by Binyamin Netanyahu, the Prime Minister that it hates because he is so successful.
The coalition's main partners are the Likud, headed by Netanyahu; Jewish Home, headed by Naftali Bennett; Yisrael Beitenu, headed by Avigdor Lieberman; Yesh Atid, headed by Yair Lapid; and HaTnua, headed by Tzipi Livni.
Not one of the parties really loves the other, and more accurately, everyone hates each other. Bennett and Lapid started out the coalition as the oddest of odd couples, but its life span was pre-destined to be short.
Lieberman for years has said that he will be Prime Minister one day, and Netanyahu looks over his shoulder so often that he is under constant medical treatment for a stiff neck.
Bennett, the most unseasoned of them all, swings back and forth from tree to tree, depending on whether he wants to please the settlers or Lapid's voters.
Livni, whose party has only six seats in the Knesset and which will barely squeak into the next Knesset, according to polls, throws around borrowed weight that hides her hapless political performance and destiny.
In the background, the Haredi parties are breathing fire through their nostrils, begging to be begged to help Netanyahu form a new coalition or possibly Lapid to form an alternative coalition.
Don't worry. The lion is not about lie down with the sheep.
Left-wing Meretz and center-left Labor want new elections because they have nothing to gain by their somewhat weak standing as opposition parties that roar like a mouse.
So will new elections be held soon?
Here are three of several rules in Israeli politics:
First, there are no rules, even the one that says that there are no rules.
Secondly, if elections were held every time the media reports that a coalition will not survive, Israelis would be going to polls twice a week.
Thirdly, since only Netanyahu, Bennett and Lieberman probably would gain from new elections, the beasts probably will be back in their cages by next week, if not by this evening.
It is questionable whether the issues are the reason for the current crisis or whether they simply symbolize the need of the beasts to escape once in a while for exercise.
The big issue for months has been Lapid's proposal to eliminate the 18 percent Value Added Tax (VAT) on the purchase of new homes. The bill for zero VAT has so many holes in it that it could not pass as Swiss cheese, but no one in Israel likes to confuse the circus – or jungle – with facts.
Under the bill, if it is ever passed into law, the lucky buyer who won't pay the tax will have had to serve in IDF – 18 months for a man and 12 months for a woman. The home must not be larger than 140 square meters and cost no more than 1.6 million shekels.. The buyers must be employed – bye, bye Haredim – and must not have owned another home in the past 19 years and must be at least 35 years old and have at least one child.
All of these conditions whittle down the potential buyers to a small minority, but the noise over the proposal has been enough to shake the nation to its foundations.Tzvi Ben-Gedalyahu
The PLO leadership on Monday night announced that it is in the process of putting together a plan for the Palestinian Authority to join international organizations under UN direction, as well as sign international conventions, Israel Radio reports.
The plan is being devised by the PLO political committee, on instructions from PA Chairman Mahmoud Abbas.
When the current peace negotiations began, some seven months ago, the Palestinians committed to delay approaching international organizations for recognition, in return for the release of 104 terrorists from Israeli jails.
That one worked out nicely.
The PLO announcement Monday night blamed Israel's government for the difficulties in the political process.
Jewish Home Chairman and Minister of the Economy Naftali Bennett told Israel Radio there's no difference between Abbas and his predecessor Yasser Arafat. Bennett said the PA chairman, like Arafat, keeps talking about a million shahids-martyrs marching on Jerusalem and refusing to ever give up the "right of return," not just for Arab refugees who actually left their homes in Israel in 1948-9, but all of their descendants.
Likud MK Tzachi Hanegbi told Israel Radio that it appears the Palestininas have been objecting to the U.S. attempts to galvanize a statement of principles reflecting the progress that's been reached on some core issues. Hanegbi believes has been gravitating to an anti-peace position from which he is refusing to depart, over Jerusalem, the right of return and recognizing Israel as a Jewish state.
Senior Labor MK Eitan Cabel told Israel Radio he thinks neither side has been negotiating in good faith, and they each spend their time looking for ways to pin the failure of the talks on the other.
On Sunday, Palestinian Authority Foreign Minister Riyad al-Maliki met with Secretary of State John Kerry it the office of the American ambassador to Paris, and told the secretary that the Palestinians oppose recognizing Israel as a Jewish state and insist that East Jerusalem becomes the future Palestinian capital.
Commenting on Kerry's new shuttle meetings with Arab foreign ministers who are members of an Arab League committee, to solicit their support for the peace process, al-Maliki said Arab diplomats support the Palestinian position on all major issues.Yori Yanover
Bayit Yehudi announced that NIS 65 million of government funding earmarked for Hesder and Haredi Yeshivas will be transferred before Rosh Hashanah.
The money was supposed to have been transferred a while ago, but Yair Lapid's Finance Ministry has been holding up the transfer after they realized that Haredi Yeshivas would also benefit from this budget.
The amount of funding that is transferred in this basket is based on the percent of students in the Yeshiva that serve in the army. With Yeshivas with no IDF soldiers getting the least per student, and Yeshivas with more than 70% enlistment getting the most per student.
Education Minister Shai Piron (Yesh Atid) assisted Naftali Bennett (Bayit Yehudi) in getting the money transferred.
The Hesder Yeshiva also received NIS 15 million two weeks ago from the Ministry of Defense.Jewish Press News Briefs
The Yesh Atid party, chaired by Yair Lapid, continues to lose popularity in the latest poll, with Meretz picking up the pieces and Likud, Jewish Home and Labor holding on to their strength.
If elections were held today, Lapid's party would win only 12 seats, compared with 19 Knesset Members that it won in the elections last February, according to the Smith polls commissioned by Globes business newspaper.
In the previous poll, Yesh Atid won 14 seats, and the reasons for Finance Minister Lapid having fallen into disfavor range from his cuts in welfare support and child allowances to tax hikes and his undiplomatic remarks that his critics are like "nervous schnauzers left out in the rain."
The left-wing Meretz party picked up another two seats in the latest poll, which now gives it 11 projected seats in the Knesset, almost double its current strength.
The Likud-Beiteinu, Labor and Jewish Home parties are unchanged, and Tzipi Livni managed to pick up one seat after seeing her popularity plummet in the last poll. Her HaTnuah party now would win four seats, two less than it currently has. Shas lost one seat in the poll to the United Torah Judaism Haredi party.Jewish Press News Briefs
Printed from: http://www.jewishpress.com/news/breaking-news/142961/2013/08/29/
Scan this QR code to visit this page online: