Optimal Distributed Resource Allocation

We present and explore the problem of automatic distributed resource allocation for a large scale system operating on the basic principles of a free market economy. We model such environment as a resource allocation problem where the producers and consumers are numerous distributed entities controlled by different interests that trade resource time to achieve their goals and maximize their individual objective functions. A consumer specifies her problem in terms of a graph of resource types that describes temporal relationships between the resources. A resource type is expressed by a predicate that establishes the necessary properties that a resource needs to satisfy to be used in a solution. The consumer also specifies an objective function in terms of the resource type attributes, that needs to be maximized while searching for a solution. A feasible reservation on the part of a consumer, is a set of resources each of which satisfies the required constraints of its type and is available at such times as dictated by the temporal execution order specified by the graph. We present two polynomial-time algorithms for finding feasible and optimal reservation plans. We also introduce a method to perform a distributed atomic transaction to commence the reservation of the chosen resources. The transaction method is based oil the call-option financial instrument that is well suited for the problem. Finally we show how to use these algorithms to solve the problems in crisis management applications

Automating resource management for distributed business processes

A distributed business process is a set of related activities performed by independent resources offering services for lease. For instance, constructing an office building involves hundreds of activities such as excavating, plumbing and carpentry performed by machines and subcontractors, whose activities are related in time, space, cost and other dimensions. In the last decade Internet-based middleware has linked consumers with resources and services enabling the consumers to more efficiently locate, select and reserve the resources for use in business processes. This recent capability creates an opportunity for a new automation of resource management that can assign the optimal resources to the activities of a business process to maximize its utility to the consumer and yield substantial gains in operational efficiency. This thesis explores two basic problems towards automating the management of distributed business processes: 1. How to choose the best resources for the activities of a process (the Activity Resource Assignment - ARA - optimization problem); and 2. How to reserve the resources chosen for a process as an atomic operation when time has value, i.e., commit all resources or no resources (the Distributed Service Commit problem - DSC). I believe these will become the typical optimization and agreement problems between consumers and producers in a networked service economy. I propose a solution to the ARA optimization problem by modeling it as a special type of Integer Programming and I give a method for solving it efficiently for a large class of practical cases. Given a problem instance the method extracts the structure of the problem and using a new concept of variable independence recursively simplifies it while retaining at least one optimal solution. The reduction operation is guided by a novel procedure that makes use of the recent advances in tree-decomposition of graphs from the graph complexity theory. The solution to the DSC problem is an algorithm based on financial instruments and the two-phase commit protocol adapted for services. The method achieves an economically sensible atomic reservation agreement between multiple distributed resources and consumers in a free market environment. I expect the automation of resource management addressed in my thesis and elsewhere will pave the way for more efficient business operations in the networked economy

Micro-Option: A Method for Optimal Selection and Atomic Reservation of Distributed Resources in a Free Market Environment

Many business processes can be described as partial orderings of tasks. We propose a model where each task is performed by one resource leased in a free market and all the resources for the process must be reserved atomically. The main problem we introduce and solve here is as follows: Given: 1. A process composed of tasks to be executed in a specified partial order 2. A set of resource types (people, information, machines) required to execute each task 3. An objective function as a metric for choosing one resource over another find and select the best resources (specific people, vehicles, computers, etc.) for each task, and commit all the resources for the entire process as an atomic operation, i.e., commit all resources or no resources. This problem is an abstraction of what we believe will become a typical optimization and agreement problem between consumers and suppliers in electronic commerce for services. We give a solution to the problem in two parts: an algorithm for selecting optimal resources for a business process, and a method (Micro-Option) for achieving an atomic reservation agreement between multiple distributed resources and consumers in a free market environment. Managing atomic agreements between multiple parties is the key problem for the lease-based free markets for services that we expect would form in the near future. Our Micro-Option method solves this problem for many business processes

Micro-Option: A Method for Optimal Selection and Atomic Reservation of Distributed Resources in a Free Market Environment

Many business processes can be described as partial orderings of tasks. We propose a model where each task is performed by one resource leased in a free market and all the resources for the process must be reserved atomically. The main problem we introduce and solve here is as follows: Given: 1. A process composed of tasks to be executed in a specified partial order 2. A set of resource types (people, information, machines) required to execute each task 3. An objective function as a metric for choosing one resource over another find and select the best resources (specific people, vehicles, computers, etc.) for each task, and commit all the resources for the entire process as an atomic operation, i.e., commit all resources or no resources. This problem is an abstraction of what we believe will become a typical optimization and agreement problem between consumers and suppliers in electronic commerce for services. We give a solution to the problem in two parts: an algorithm for selecting optimal resources for a business process, and a method (Micro-Option) for achieving an atomic reservation agreement between multiple distributed resources and consumers in a free market environment. Managing atomic agreements between multiple parties is the key problem for the lease-based free markets for services that we expect would form in the near future. Our Micro-Option method solves this problem for many business processes

Data Manager for Evolvable Real-Time Command and Control Systems

We describe the design and implementation of real-time data management services. These services combine technologies developed in the context of real-time distributed object management, object DBMSs, and scheduling. This combination simplifies many of the services, and produces a result which is greater than the sum of its parts, because it can be used to improve the portability and flexibility of real-time applications. 1 Introduction Many real-time command and control systems have been deployed which use custom-written real-time data management (RTDM) software that is highly tuned to particular requirements. This custom software is not only expensive to develop, but because it is entwined with the applications, must be rewritten when requirements change. We have developed an approach that makes real-time command and control software more evolvable by using shared, flexible RTDM services. This paper surveys past and ongoing RTDM and distributed object systems work by the authors and..

Data Manager for Evolvable Real-Time Command and Control Systems

We describe the design and implementation of real-time data management services. These services combine technologies developed in the context of real-time distributed object management, object DBMSs, and scheduling. This combination simplifies many of the ser-vices, and produces a result which is greater than the sum of its parts, because it can be used to improve the portability and flexibility of real-time applications.

The Design of an Open System with Distributed Real-Time Requirements

This paper describes some of the US Navy's New Attack Submarine C3I system - an open system with distributed real-time requirements. It also presents our research design and prototyping efforts that address these requirements. It concludes by discussing several areas where further research is needed to allow open systems to better support real-time applications. 1 Introduction With the advent of U.S. government mandates for open systems in their computer system procurements, even large distributed real-time applications will need to meet the requirements of using commercial-off-the-shelf (COTS) technology with interfaces that adhere to widely accepted standards. As part of our work with the US Navy's UnderSea Warfare Center, the US Navy's Research and Development Labs (NRad), and Loral Federal Systems, we have assisted in specifying the requirements and a possible design of aspects of the US Navy's New Attack Submarine (NSSN) Command Control Communication and Intelligence (C3I) system..