Correlation-Aware Object Placement for Multi-Object Operations

A multi-object operation incurs communication or synchronization overhead when the requested objects are distributed over different nodes. The object pair correlations (the probability for a pair of objects to be requested together in an operation) are often highly skewed and yet stable over time for real-world distributed applications. Thus, placing strongly correlated objects on the same node (subject to node space constraint) tends to reduce communication overhead for multi-object operations. This paper studies the optimization of correlation-aware data placement. First, we formalize a restricted form of the problem as a variant of the classic Quadratic Assignment problem and we show that it is NP-hard. Based on a linear programming relaxation, we then propose a polynomial-time algorithm that generates a randomized object placement whose expected communication overhead is optimal. We further show that the computation cost can be reduced by limiting the optimization scope to a relat...

• Type: Conference
• Year: 2008
• Where: ICDCS
• Authors: Ming Zhong, Kai Shen, Joel I. Seiferas
• Keywords: Communication Overhead, Distributed And Parallel Computing, ICDCS 2008, Multi-object Operations, Object Placement