On Tue, 14 May 2013 19:11:54 +0200, Stefan Behrens wrote:
On Tue, 14 May 2013 18:55:23 +0800, Liu Bo wrote:
On Tue, May 14, 2013 at 11:36:52AM +0200, Stefan Behrens wrote:
Mapping UUIDs to subvolume IDs is an operation with a high effort
today. Today, the algorithm even has quadratic effort
On Tue, May 14, 2013 at 07:11:54PM +0200, Stefan Behrens wrote:
# of subvols | without| with
in filesystem | UUID tree | UUID tree
--++--
2 | 0m00.004s | 0m00.003s
1000 | 0m07.010s | 0m00.004s
2000 | 0m28.210s | 0m00.004s
Mapping UUIDs to subvolume IDs is an operation with a high effort
today. Today, the algorithm even has quadratic effort (based on the
number of existing subvolumes), which means, that it takes minutes
to send/receive a single subvolume if 10,000 subvolumes exist. But
even linear effort would be
On Tue, May 14, 2013 at 11:36:52AM +0200, Stefan Behrens wrote:
Mapping UUIDs to subvolume IDs is an operation with a high effort
today. Today, the algorithm even has quadratic effort (based on the
number of existing subvolumes), which means, that it takes minutes
to send/receive a single
On Tue, 14 May 2013 18:55:23 +0800, Liu Bo wrote:
On Tue, May 14, 2013 at 11:36:52AM +0200, Stefan Behrens wrote:
Mapping UUIDs to subvolume IDs is an operation with a high effort
today. Today, the algorithm even has quadratic effort (based on the
number of existing subvolumes), which means,
