Difference between revisions of "Mainline fast symbol resolution for kernel module loading"

From eLinux.org
Jump to: navigation, search
(Created page with "; Summary: Mainline fast symbol resolution for kernel module loading ; Proposer: Tim Bird == Description == Symbol resolution for loading kernel modules can take a long time, s...")
 
(Mainlined)
 
(One intermediate revision by one other user not shown)
Line 8: Line 8:
 
lookup.
 
lookup.
  
Various projects have demonstrated improved the symbol resolution time
+
Various projects have demonstrated improved symbol resolution time
 
for kernel modules, using either binary trees or hash tables.  Each
 
for kernel modules, using either binary trees or hash tables.  Each
 
approach has its pros and cons, but as of January 2010 neither approach
 
approach has its pros and cons, but as of January 2010 neither approach
Line 22: Line 22:
 
** [[Media:C_AMOROSO_Fast_lkm_loader_ELC-E_2009.pdf]]
 
** [[Media:C_AMOROSO_Fast_lkm_loader_ELC-E_2009.pdf]]
  
== Scope ==
+
== Status ==
Maybe 1 month?
+
  
== Contractor Candidates ==
+
Mainlined in v3.0
 
+
== Comments ==
+
  
 
[[Category:Project proposals 2011]]
 
[[Category:Project proposals 2011]]

Latest revision as of 10:34, 24 July 2011

Summary
Mainline fast symbol resolution for kernel module loading
Proposer
Tim Bird

Description

Symbol resolution for loading kernel modules can take a long time, since the current symbol lookup mechanism in the kernel is a linear lookup.

Various projects have demonstrated improved symbol resolution time for kernel modules, using either binary trees or hash tables. Each approach has its pros and cons, but as of January 2010 neither approach has been mainlined.

This project would consist of mainlining one of these approaches to reducing symbol resolution time for kernel loadable modules.

Related work

Status

Mainlined in v3.0