Resource management: Difference between revisions

From Computer Science Wiki
No edit summary
No edit summary
Line 4: Line 4:




== The big ideas in Abstract data structures ==  
== Big ideas in resources management ==


=== Thinking recursively ===
=== System resources ===
* [[Recursive thinking]]
* [[Recursive algorithms]]


=== Abstract data structures ===
* [[Computer resources]]


* [[Two dimensional arrays]]
=== Role of the operating system ====
* [[Stack]]
* [[Queue]]


=== Linked lists ===
* [[Operating Systems]]
 
* [[Operating Systems management techniques]]
* [[Dynamic data structures]]
* [[Dedicated operating system for a device.]]
* [[Linked lists]]
 
=== Trees ===
 
* [[Trees]]


== References ==
== References ==
Line 29: Line 20:


[[Category:resource management]]
[[Category:resource management]]
[[Category:Operating Systems]]
[[Category:HL]]
[[Category:HL]]
[[Category:problem-solving]]
[[Category:problem-solving]]

Revision as of 15:55, 12 April 2016

Resource Management[1]

In computer programming, resource management refers to techniques for managing resources (components with limited availability). It includes both preventing resource leaks (releasing a resource when a process has finished using it) and dealing with resource contention (when multiple processes wish to access a limited resource). Resource leaks are an issue in sequential computing, while resource contention is an issue in concurrent computing. On many systems the operating system reclaims resources after the process makes the exit system call.[2]


Big ideas in resources management

System resources

Role of the operating system =

References