Sharing resources at nonuniform access rates

Theory of Computing Systems

Volumn 34, Issue 1, 2000, Pages 13-26

  Barbosa, V C ^a   Benevides, M R F ^a   Franca F M G ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

PHILOSOPHICAL ASPECTS;

ASYNCHRONOUS DIGITAL CIRCUITS; DINING PHILOSOPHERS PROBLEM; DISTRIBUTED SCHEDULING; NEURAL NETWORK MODEL; NON-UNIFORM ACCESS; RELATIVE FREQUENCIES; RESOURCE SHARING PROBLEM; SHARING RESOURCES;

PROBLEM SOLVING;

EID: 0035605852     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240010008     Document Type: Article

References (9)

1. V. C. Barbosa, Concurrency in systems with neighborhood constraints, Ph.D. Dissertation, Computer Science Department, University of California, Los Angeles, CA, 1986.
2. V. C. Barbosa, An Introduction to Distributed Algorithms, The MIT Press, Cambridge, MA, 1996.
3. V. C. Barbosa and E. Gafni, Concurrency in heavily loaded neighborhood-constrained systems, ACM Transactions on Programming Languages and Systems, 11 (1989), 562-584.
4. K. M. Chandy and L. Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems, 3 (1985), 63-75.
5. K. M. Chandy and J. Misra, The drinking philosophers problem, ACM Transactions on Programming Languages and Systems, 6 (1984), 632-646.
6. E. W. Dijkstra, Hierarchical ordering of sequential processes, Acta Informatica, 1 (1971), 115-138.
7. F. M. G. França, Scheduling weightless systems with self-timed Boolean networks, in: Proceedings of the Weightless Neural Networks Workshop (1993), pp. 87-92.
8. F. M. G. França, Neural networks as neighbourhood-constrained systems, Ph.D. Thesis, Imperial College London, 1994.
9. F. M. G. França, V. C. Alves, and E. P. Granja, Asynchronous digital circuits as neighbourhood-constrained systems, Technical Report ES-357/95, COPPE/UFRJ, Rio de Janeiro, 1995.