Deadlock prevention with collectively occupied resources

In a simple modification of Dijkstra's banker algorithm makes it possible for any separable resource to be allocated to several parallel processes (collective fixation). Algorithms of resource fixation and release are described whereby deadlocks are avoi­ded and a theorem confirming their legitimacy is proved.