Abstract: A system and method which allows complex tasks to be scheduled and/or coordinated on one or more computer systems by focusing the level of autonomy to each phase of a plan. The phases include computational components and may spawn target phases such that the phases are dependent on the target phases. The phases may begin execution upon completion of the target phases. Each phase may determine further execution, including succeeding phases, in an event-driven manner.

Abstract: A method (and structure) in a computer network of controlling the admittance of requests to at least one processing component, includes differentiating the type of received requests based on the message content in each request. Each request is admitted only if the differentiated type meets at least one criterion for admission.

Abstract: A method (and structure) in a computer network of controlling the admittance of requests to at least one processing component, includes differentiating the type of received requests based on the message content in each request. Each request is admitted only if the differentiated type meets at least one criterion for admission.

Abstract: A system and method which allows complex tasks to be scheduled and/or coordinated on one or more computer systems by focusing the level of autonomy to each phase of a plan. The phases include computational components and may spawn target phases such that the phases are dependent on the target phases. The phases may begin execution upon completion of the target phases. Each phase may determine further execution, including succeeding phases, in an event-driven manner.

Abstract: A system and method for non-sequential program execution in an incompletely assembled runtime environment. In a program debugging context, a primary advantage is that neither a fully linked executable nor a complete code base is required to execute the program. As well, it is not necessary to begin execution at the traditional program entry point. Six key methods are described. Virtual execution initialization logic involves establishing the runtime environment within the context of the first statement of execution. Statement execution logic concerns execution of a program statement and a technique by which the runtime copes with incomplete information. Reset execution point logic allows the user to randomly reposition the current execution point within a program without violating the runtime environment. Finally, methods for adding and deleting callers into/from the runtime stack are outlined.

Abstract: This invention provides a small and efficient set of primitives for debugging a distributed application that runs on a plurality of processors connected by a common network. These primitives permit a user to debug a distributed application in a manner similar to debugging a non-distributed application. The invention allows a user to step into and return from a remote procedure call in exactly the same manner as a local procedure call. The invention also allow a user to set breakpoints in a server for specific clients and to specify conditions under which a particular remote call from a client should trap in a server. These capabilities greatly simplify the process of debugging distributed applications such as client-server programs.