Abstract: A distributed system framework and a distributed system architecture that includes three features: it can accommodate a large number of addressable entities, it is possible to connect any arbitrary group of entities together into a virtual network, and the infrastructure supports large numbers of concurrent virtual networks.

Abstract: A structured multithreaded programming system is described for integrated use with existing and new programming languages and systems. The structured multithreaded programming system enables programs to be developed which include both multithreaded and multithreadable code constructs. The multithreaded code constructs require explicitly concurrent execution. The multithreadable code constructs can be executed either sequentially or concurrently, at the selection of the programmer or computer user. When executed concurrently, the different threads of execution in a multithreaded program developed with this system can be synchronized using innovative synchronization objects. One type of synchronization object is a special type of counter, which can be constrained to be monotonically increasing in value. Another related type of synchronization object is a special type of flag, which can be constrained to have its value set monotonically.

Abstract: The present invention is a method and computer product for automating resource management. One embodiment is a method targeted at solving an optimization problem termed Activity Resource Assignment (ARA). ARA formalizes the selection of optimal resources for activities of a given process. The selection is based on an objective function expressed as an algebraic composition of relationships among the activities. ARA gives a new solution method that finds an optimal solution, in polynomial time, for many seemingly intractable instances. The exponent of the polynomial in the algorithm is related to the tree-width of a relationship graph that can be constructed for any given process specification. ARA is combined with a method targeted to solving the Distributed Service Commit (DSC) problem, which addresses the need to coordinate the resources chosen by an optimization to carry out the business process. DSC is targeted to the issue of achieving an atomic distributed agreement of resources.

Abstract: A mesh connected local area network provides automatic packet switching and routing between host computers coupled to the network. The network has a multiplicity of cut-through, nonblocking switches, each capable of simultaneously routing a multiplicity of data packets. Low host-to-host latency is achieved through the use of cut-through switches with separate internal buffers for each packet being routed. The switches are interconnected with one another and are coupled to the host computers of the network by point to point full duplex links. While each switch can be coupled to ten or more network members, i.e., switches and hosts, each link is coupled to only two network members and is dedicated to carrying signals therebetween. Whenever a new switch or link is added to the network, and whenever a switch or link fails, the switches in the network automatically reconfigure the network by recomputing the set of legal paths through the network.