On data structures and parallelism

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



There was an interesting discussion at

http://realworldtech.com/forums/index.cfm?action=detail&id=98909&threadid=98430&roomid=2

that involves DAGs and decompression in Git. The problem is achieving 
parallelism. The following comment was made:

"And is it possible to store the block pointers from one object to 
another in uncompressed form?"

Is there a case in Git where an "object" could store SHA1 in 
uncompressed format, allowing prefetching the next object in chain 
before uncompressing the current object? Prefetching could increase 
parallelism (and speedup) in some cases.

A quick glance at Git's source code showed that commit objects are 
compressed. Having even a single parent SHA1 in uncompressed format 
would allow some prefetching. All but perhaps a few objects contain at 
least one parent SHA1 :-)

-- 
Heikki Orsila
heikki.orsila@xxxxxx
http://www.iki.fi/shd
--
To unsubscribe from this list: send the line "unsubscribe git" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at  http://vger.kernel.org/majordomo-info.html

[Index of Archives]     [Linux Kernel Development]     [Gcc Help]     [IETF Annouce]     [DCCP]     [Netdev]     [Networking]     [Security]     [V4L]     [Bugtraq]     [Yosemite]     [MIPS Linux]     [ARM Linux]     [Linux Security]     [Linux RAID]     [Linux SCSI]     [Fedora Users]