State (computer science)

About: State (computer science) is a research topic. Over the lifetime, 24436 publications have been published within this topic receiving 225733 citations.

A mobile-agent-based PC grid

Abstract: This paper proposes a mobile-agent-based middleware that benefits remote computer users who wish to mutually offer their desktop computing resource to other Internet group members while their computers are not being used. Key to this resource exchange grid is the use of mobile agents. Each agent represents a client user, carries his/her job requests, searches for resources available for the request, executes the job at suitable computers, and migrates it to others when the current ones have become unavailable for use. All the features of job migration will be encapsulated in a user program wrapper that is implemented on Java layer between a mobile agent and the corresponding user program. The wrapper maintains the complete execution state of the user program, is carried by the mobile agent upon a job migration, and restores its user program its destination. For this purpose, a user program is preprocessed with JavaCC and ANTLR to include check-pointing functions before its execution. These functions periodically save the execution state of a user program into its corresponding program wrapper, which can thus be carried by an agent smoothly.

Dynamic creation of workflows from deterministic models of real world processes

Abstract: A workflow generated from a declarative model of a real world process represents the procedural steps to accomplish the process. In one embodiment, the declarative model may include a first number of state nodes and a second number of task nodes interconnected with the state nodes. In such cases, generating a workflow may be accomplished by choosing one of a number of paths through th emodel, each of the paths comprising an alternating series of one or more of the state nodes and one or more of the task nodes with any predecessor state node in one of the paths representing a precondition for a subsequent task node along the one of the paths and any following state node of the subsequent task node along the one of the paths representing a result of applying one or more actions that correspond to that task node. As part of a computer assisted scheduling system, the model may be configured to receive updates reflecting changes in the real-world manufacturing environment. Such changes may represent completed tasks, and/or a change in the availability of one or more resources represented in the model.

Hybrid peer-to-peer data communication and management

Abstract: Hybrid peer-to-peer data communication and management is described, including querying a plurality of elements (302-316, 318, 324- 332 and 336-344) in an environment (300) for state data, the state data describes a state of the environment (300) and an activity occurring in the environment (300), receiving the state data from one or more of the plurality of elements (302-316, 318, 324-332 and 336-344) in response to the querying, analyzing the state data to determine an environmental change, the updated state data is generate describing the environmental change, and using the updated state data to modify the environment (300) by dynamically allocating the plurality of elements to process a simulation, the plurality of elements (302-316, 318, 324-332 and 336-344) being dynamically allocated based on available processing capacity provided by the plurality of elements (302-316, 318, 324-332 and 336-344).

Modular architecture for analysis database

Abstract: A modularized architecture using vertical partitioning of a database is configured to store object metadata and processing results of one or more objects analyzed by a state machine, such as an analysis engine of a malware detection system. The database may include data structures, such as one or more master blocks, state sub-blocks, and state co-tables, as well as state transition queues. The modularized architecture may organize the database as one or more stages of the state machine, such that each stage corresponds to a module of the state machine, wherein the module generates results that are stored in its associated state co-table, which then provides information for a next stage. Each next stage may have a dependency on the one or more prior stages that provide input for execution of the next stage module. Dependency logic associated with each stage may determine whether the dependency is satisfied and, if so, may insert an action request into the state transition queue for the next stage to invoke an action associated with that stage.