Abstract: A system and method are described in which skeletons and/or stubs are manipulated based on deployment information. For example, a method according to one embodiment of the invention comprises: compiling source code to generate program code executable on an application server comprised of a plurality of different virtual machines, the program code containing stubs and/or skeletons; analyzing the program code to identify stubs and/or skeletons generated for objects which are located within the same virtual machine and/or the same physical machine; removing the stubs and/or skeletons for those objects which are located in the same virtual machine and/or same physical machine to generate modified program code; and deploying the modified program code.

Abstract: A computer implemented system and method for scheduling jobs. A method according to one embodiment includes the operations of: determining a first possible execution time of a job from a data object containing a job timing entry; determining if a specified base time is less than a first possible execution time of the job; if the specified base time is less than the first possible execution time, then subtracting the base time from the first possible execution time to determine the time until the next execution of the job; and if the specified base time is greater than the first possible execution time, then searching for a next execution time which is greater then the specified base time and subtracting the base time from the next execution time to determine the time until the next execution of the job.

Abstract: A computer implemented system and method for scheduling jobs. A method according to one embodiment includes the operations of: determining a first possible execution time of a job from a data object containing a job timing entry; determining if a specified base time is less than a first possible execution time of the job; if the specified base time is less than the first possible execution time, then subtracting the base time from the first possible execution time to determine the time until the next execution of the job; and if the specified base time is greater than the first possible execution time, then searching for a next execution time which is greater then the specified base time and subtracting the base time from the next execution time to determine the time until the next execution of the job.