This paper describee the balanced cube, a new data structure for implementing ordered
seta. Conventional dats structures such as heaps, balanced trees and B-trees have root
bottlenecks which limit their potential concurrency and make them unable to take advantage
of the computing potential of concurrent machines. The balanced cube achieves greater
concurrency by eliminating the root bottleneck; an operation in the balanced cube can be
initiated from any node. The throughput of the balanced cube on a concurrent computer is O times O/Log N compared with O(1) for a conventional data structure. Operations on the balanced cube are shown to be deadlock free and consistent with a sequential execution ordered by completion time
