Cost effective priority assignment in network computers

Abstract

The person charging this material is responsible for its renewal or its return to the library from which it was borrowed on or before the Latest Date stamped below. The Minimum Fee for each Lost ABSTRACT With the advent of network computers, a new area of computer systems analysis has evolved. Unfortunately, most of the work which has been done to date merely extends the previously existing theory of communications. While this work has been very fruitful and produced important results, our analysis is predicated on the assumption that a geographically distributed network computer is, in reality, quite different from telephone networks and individual computing centers. In this paper, we focus our attention on the probable goals of the networks and define a measure of cost effectiveness. Then using this measure we develop a priority assignment technique for the individual centers that comprise the network. We conclude by expanding the measure of cost effectiveness to determine load leveling rules for the entire network.

Negotiation as a Metaphor for Distributed Problem Solving

“…Each Idle node chooses the most interesting task to bid on, without reference to what other idle nodes may be choosing; each manager chooses the best bid(s) it has received without reference to what any other manager may be doing. The best global assignment does not necessarily result from the simple concatenation of all of the best local ansignments.1 2 Consider for example a situation in which two managers (A and B) have both announced tasks, and two potential contractors (X and Y) have each responded by bidding on both tasks. Imagine further that from A's perspective, X's bid is rated .9 (on a 0 to 1 scale), while Y's is rated .8 ( Figure 19).…”

Frameworks for Cooperation in Distributed Problem Solving

“…It has generally been assumed, for example, that a well-defined and a priori partitioned problem exists and that the major concerns lie in an optimal static distribution of tasks, methods for interconnecting processor nodes, resource allocation, and prevention of deadlock. Complete knowledge of timing and precedence relations between tasks has generally been assumed, and the major reason for distribution has been taken to be load balancing (see for example [1], [3]). Distributed problem solving, on the other hand, includes as part of its basic task the partitioning of a problem.…”

“…For a DSS, the problem decomposition is suggested directly by the spatial distribution of the problem. 3 There is also no answer synthesis phase for traffic-light control. The solution to a kernel subproblem is a smooth flow of traffic through the associated intersection.…”

Design automation in network computers

“…We have devised algorithms for scheduling jobs within a center [2,3] and we have determined dispatching rules [4] to enable dynamic load regulation in the network.…”