find_next_best_node man page on OpenSuSE

Man page or keyword search:  
man Server   25941 pages
apropos Keyword Search (all sections)
Output format
OpenSuSE logo
[printable version]

FIND_NEXT_BEST_NODE(9)	  Memory Management in Linux	FIND_NEXT_BEST_NODE(9)

NAME
       find_next_best_node - find the next node that should appear in a given
       node's fallback list

SYNOPSIS
       int find_next_best_node(int node, nodemask_t * used_node_mask);

ARGUMENTS
       node
	   node whose fallback list we're appending

       used_node_mask
	   nodemask_t of already used nodes

DESCRIPTION
       We use a number of factors to determine which is the next node that
       should appear on a given node's fallback list. The node should not have
       appeared already in node's fallback list, and it should be the next
       closest node according to the distance array (which contains arbitrary
       distance values from each node to each node in the system), and should
       also prefer nodes with no CPUs, since presumably they'll have very
       little allocation pressure on them otherwise. It returns -1 if no node
       is found.

COPYRIGHT
Kernel Hackers Manual 3.11	 November 2013		FIND_NEXT_BEST_NODE(9)
[top]

List of man pages available for OpenSuSE

Copyright (c) for man pages and the logo by the respective OS vendor.

For those who want to learn more, the polarhome community provides shell access and support.

[legal] [privacy] [GNU] [policy] [cookies] [netiquette] [sponsors] [FAQ]
Tweet
Polarhome, production since 1999.
Member of Polarhome portal.
Based on Fawad Halim's script.
....................................................................
Vote for polarhome
Free Shell Accounts :: the biggest list on the net