As storage systems scale from a few storage nodes to hundreds or thousands, data distribution and load balancing become increasingly important. We present a novel decentralized algorithm, RDIM (Replication Under Dynamic Interval Mapping), which maps replicated objects to a scalable collection of storage nodes. RDIM distributes objects to nodes evenly, redistributing as few objects as possible w...

Typical algorithms for decentralized data distribution work best in a system that is fully built before it first used; adding or removing components results in either extensive reorganization of data or load imbalance in the system. We have developed a decentralized algorithm, RUSH (Replication Under Scalable Hashing), that maps replicated objects to a scalable collection of storage servers or ...

Balancing and dual Domain Decomposition Methods (DDMs) are used in practice on parallel computing environments with the number of generated subdomains being generally larger than the number of available processors. The present study describes partitioning concepts used to: (a) generate subdomains for such DDMs and (b) organize these subdomains into subdomain clusters, in order to assign each cl...

Based on unbalanced panel dates of 4060 companies listed from 2003 2007 in Shanghai and Shenzhen Stock Markets, this paper empirically studies the degree of product market competition, the relationship between cash dividends distribution tendency and cash dividends policy. Results show that controlling shareholders have significant motivation to distribute cash dividends, and this kind of incen...

Article history: Received 9 April 2009 Available online 17 September 2010 Communicated by Luchezar L. Avramov Dedicated to Professor Claus Michael Ringel on the occasion of his sixty-fifth birthday MSC: 18G25 18E30 16E65

We introduce the concept of combed graphs and present an ear decomposition theorem for this class of graphs. This theorem includes the well known ear decomposition theorem for matching covered graphs proved by Lovász and Plummer. Then we use the ear decomposition theorem to show that any two edges of a 2-connected combed graph lie in a balanced circuit of an equivalent combed graph. This result...