openhub.net
Black Duck Software, Inc.
Open Hub
Follow @
OH
Sign In
Join Now
Projects
People
Organizations
Tools
Blog
BDSA
Projects
People
Projects
Organizations
Forums
behlendorf's zfs
Settings
|
Report Duplicate
1
I Use This!
×
Login Required
Log in to Open Hub
Remember Me
Activity Not Available
Analyzed
7 months
ago. based on code collected
7 months
ago.
Project Summary
Native ZFS for Linux
Tags
No tags have been added
In a Nutshell, behlendorf's zfs...
...
has had
9,531 commits
made by
736 contributors
representing
529,588 lines of code
...
is
mostly written in C
with
a well-commented source code
...
has
a well established, mature codebase
maintained by
a very large development team
with
stable Y-O-Y commits
...
took an estimated
145 years of effort
(COCOMO model)
starting with its
first commit in November, 2008
ending with its
most recent commit 8 months
ago
Quick Reference
Project Links:
Homepage
Code Locations:
https://github.com/behlendorf/zfs
Similar Projects:
Managers:
Become the first manager for behlendorf's zfs
This Project has No vulnerabilities Reported Against it
Did You Know...
...
65% of companies leverage OSS to speed application development in 2016
...
compare
projects before you chose one to use
...
in 2016, 47% of companies did not have formal process in place to track OS code
...
search
using multiple tags to find exactly what you need
Code
Lines of Code
Activity
Commits per Month
Community
Contributors per Month
Languages
C
64%
shell script
19%
Assembly
6%
9 Other
11%
30 Day Summary
Oct 15 2024 — Nov 14 2024
0
Commits
0
Contributors
12 Month Summary
Nov 14 2023 — Nov 14 2024
630
Commits
Down
-38 (5%)
from previous 12 months
93
Contributors
Down
-20 (17%)
from previous 12 months
Most Recent Contributors
Brian Behlendorf
Rob Norris
Alexander Motin
w0xel
Shengqi Chen
tstabrawa
Ratings
1 user rates this project:
5.0
5.0/5.0
Click to add your rating
Review this Project!
This site uses cookies to give you the best possible experience. By using the site, you consent to our use of cookies. For more information, please see our
Privacy Policy
Agree