Topological Properties of Hypercubes
IEEE Transactions on Computers
A novel approach to system-level fault tolerance in hypercube multiprocessors
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Performance of Fault-Tolerant Diagnostics in the Hypercube Systems
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Optimal communication algorithms for hypercubes
Journal of Parallel and Distributed Computing
Decomposing a star graph into disjoint cycles
Information Processing Letters
SIAM Journal on Computing
Fault tolerant routing in the star and pancake interconnection networks
Information Processing Letters
Parallel Information Dissemination by Packets
SIAM Journal on Computing
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Broadcasting on recursively decomposable Cayley graphs
Proceedings of the international workshop on Broadcasting and gossiping 1990
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Handbook of Database Management and Distributed Relational Databases
Handbook of Database Management and Distributed Relational Databases
Computer Networks
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Fast Gossiping by Short Messages
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Optimally Balanced Spanning Tree of the Star Network
IEEE Transactions on Computers
On the Performance and Scalability of Decentralized Monitoring Using Mobile Agents
DSOM '99 Proceedings of the 10th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management: Active Technologies for Network and Service Management
Scheduling for atomic broadcast operation in heterogeneous networks with one port model
The Journal of Supercomputing
| Hi-index | 0.00 |
Polling is the process in which an issuing node of a communication network (polling station) broadcasts a query to every other node in the network and waits to receive a unique response from each of them. Polling can be thought of as a combination of broadcasting and gathering and finds wide applications in the control of distributed systems. In this paper, we consider the problem of polling in minimum time. We give a general lower bound on the minimum number of time units to accomplish polling in any network and we present optimal polling algorithms for several classes of graphs, including hypercubes and recursively decomposable Cayley graphs.