Efficient resource usage is a key to achieving better performance in cluster systems. Previously, most research in this area has focused on balancing the load of each node to use...
Min Choi, Jung-Lok Yu, Hojoong Kim, Seung Ryoul Ma...
We propose an object-oriented framework for one of the most frequent and costly operations in parallel database systems: the parallel join. The framework independently captures a ...
HeteroSort load balances and sorts within static or dynamic networks. Upon failure of a node or path, HeteroSort uses a genetic algorithm to minimize the distribution path by optim...
Emmett Davis, Bonnie Holte Bennett, Bill Wren, Lin...
Many parallel join algorithms have been proposed in the last several years. However, most of these algorithms require that the amount of data to be joined is known in advance in o...
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...