Minimizing and Equally Loading Switches or Spatially Shared Drivers in a Multidevice Sequential Time System

An algorithm is presented to determine spatially shared driver (switch) sequences in a system which requires several drivers (switches) to activate a given device. The algorithm results in minimizing the number of drivers (switches) and in uniformly loading them if the probability density function for device selection is uniform. Plasma display and magnetic bubble memory applications illustrate the method.