Dynamic Resource Allocation Using Views

Conflicting requests to shared resources arise naturally and frequently indistributed systems. The resolution of these conflicts in a fair and timelymanner is important. We consider a general model in which processes requestrepeatedly and asynchronously for arbitrary subsets of resources. Our solutionto this dynamic problem first computes a collection of process-specific localviews that capture the conflicts for each process, and then resolves theconflicts on these views using existing algorithms. We specify therequirements on local views, and present an algorithm satisfying therequirements. The time and message complexities of the composite algorithm fordynamic conflict resolution depend minimally on global parameters and offer asignificant improvement over existing algorithms.