banker

README

banker

An implementation of Dijkstra's banker's algorithm in Go

Documentation

Index

• func Bankers(i int, request, available []int, allocation, need [][]int) (ok bool)
• func Safe(available []int, allocation, need [][]int) (ok bool, schedule []int)

Functions

func Bankers

func Bankers(i int, request, available []int, allocation, need [][]int) (ok bool)

Check whether request can be granted to i by computing a safe

schedule.

func Safe

func Safe(available []int, allocation, need [][]int) (ok bool, schedule []int)

If the state is safe, a schedule that grants maximum resources

to all processes is returned. Otherwise, the result is false and
a partial schedule.