Abstract: Methods and apparatus are provided for designing traffic distribution in a multiple-service packetized network using such multicommodity flows and well-linked terminals. Arbitrary multicommodity flows f are transformed to sets of well-linked terminals. The multicommodity flows are represented in a graph G having a set of k node-pairs s1t1, . . . ,sktk, each having a positive integer demand di and a positive weight wi. The graph G is partitioned into a collection of node-disjoint subgraphs wherein each sub-graph H contains a set of terminals, where {right arrow over (?)} is a non-negative weight function on a set X of nodes in the graph G; and then the set of terminals are clustered to a subset of terminals that is at least ¼-flow-linked or ¼-cut-linked.

Abstract: In accordance with the principles of the invention, a method and system of multiprocessor scheduling for load sharing among multiple multiprocessors to within any given error criteria, &egr;>0, is disclosed. The method comprises guessing a value for an optimal load on the processors, partitioning a plurality of multi-dimensional tasks into a set of large tasks and a set of small tasks, guessing the invention of the set of small tasks and among the set of larger tasks processors which are represented as multi-dimensional bins, packing a discretized the set of large tasks, in the guessed invention space of the multi-dimensional bins determining if the small tasks can be allocated into unallocated space of the multi-dimensional bins after packing of the discretized large tasks, and iteratively repeating the guessing steps until all the tasks can be allocated within the gussed load.