An algorithm for the reconfiguration of I/O buffers

A problem of reconfiguration of I/O buffers located on the periphery of a programmable gate array is considered. This problem is treated as a problem of shifting pebbles on a cycle. An O(mn) time algorithm is presented, where n and m are the numbers of all I/O buffers and used defective I/O buffers, respectively. A few lemmas are established that aid in the development of the algorithm.<
>