Selecting a Leader in a Clique in O(N log N) Messages

Abstract

This paper presents an extremely simple algorithm for all processors in a completely connected network to agree on a unique leader. It requires O(N log K) messages, where N is the number of processors, and K is the number of processors that independently start the algorithm.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1984
Accession Number
ADA146581

Entities

People

  • P. A. Humblet

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Advanced Electronics
  • Ground and Sea Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Electrical Engineering
  • Electronics
  • Electronics Laboratories
  • Engineering
  • Information Processing
  • Information Systems
  • Marine Corps
  • Massachusetts
  • Mathematics
  • Military Research
  • Security
  • Virginia

Readers

  • Computer Science/Computer Engineering/Data Science/Digital Signal Processing.
  • Graph Algorithms and Convex Optimization.
  • Military History of the United States in the 20th Century.