The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Complexity of network synchronization
Journal of the ACM (JACM)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Concurrency in systems with neighborhood constraints (distributed systems, parallel processing, dining philosophers, simulated annealing)
Graphs and Hypergraphs
Strategies for the Prevention of Communication Deadlocks in Distributed Parallel Programs
IEEE Transactions on Software Engineering
A calculus of superimpositions for distributed systems
AOSD '02 Proceedings of the 1st international conference on Aspect-oriented software development
Publish/subscribe scheme for mobile networks
Proceedings of the second ACM international workshop on Principles of mobile computing
IEEE Transactions on Parallel and Distributed Systems
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
On reducing the complexity of matrix clocks
Parallel Computing
Application partitioning and hierarchical management in grid environments
DSM '04 Proceedings of the 1st international doctoral symposium on Middleware
Resource-sharing system scheduling and circular chromatic number
Theoretical Computer Science
Randomized generation of acyclic orientations upon anonymous distributed systems
Journal of Parallel and Distributed Computing
Note: A connection between circular colorings and periodic schedules
Discrete Applied Mathematics
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A distributed dynamics for webgraph decontamination
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Brief announcement: full reversal routing as a linear dynamical system
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Interleaved adjoints of directed graphs
European Journal of Combinatorics
Full reversal routing as a linear dynamical system
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Resource-sharing systems and hypergraph colorings
Journal of Combinatorial Optimization
Mathematical models of object-based distributed systems
Formal modeling
A novel distributed scheduling algorithm for resource sharing under near-heavy load
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Scheduling links for heavy traffic on interfering routes in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
The effect of intelligent escape on distributed SER-Based search
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
On optimal k-fold colorings of webs and antiwebs
Discrete Applied Mathematics
Efficient checking of link-reversal-based concurrent systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Transience bounds for distributed algorithms
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
Let G be a connected undirected graph in which each node corresponds to a process and two nodes are connected by an edge if the corresponding processes share a resource. We consider distributed computations in which processes are constantly demanding all of their resources in order to operate, and in which neighboring processes may not operate concurrently. We advocate that such a system is general enough for representing a large class of resource-sharing systems under heavy load.We employ a distributed scheduling mechanism based on acyclic orientations of G and investigate the amount of concurrency that it provides. We show that this concurrency is given by a number akin to G's chromatic and multichromatic numbers, and that, among scheduling schemes which require neighbors in G to alternate in their turns to operate, ours is the one that potentially provides the greatest concurrency. However, we also show that the decision problem corresponding to optimizing concurrency is NP-complete.