<p><b>Abstract</b>—This paper describes a generalized sequential diagnosis algorithm whose analysis leads to strong diagnosability results for a variety of multiprocessor interconnection topologies. The overall complexity of this algorithm in terms of total testing and syndrome decoding time is linear in the number of edges in the interconnection graph and the total number of iterations of diagnosis and repair needed by the algorithm is bounded by the diameter of the interconnection graph. The degree of diagnosability of this algorithm for a given interconnection graph is shown to be directly related to a graph parameter which we refer to as the partition number. We approximate this graph parameter for several interconnection topologies and thereby obtain lower bounds on degree of diagnosability achieved by our algorithm on these topologies. If we let <it>N</it> denote total number of vertices in the interconnection graph and Δ denote the maximum degree of any vertex in it, then our results may be summarized as follows. We show that a symmetric <it>d</it>-dimensional grid graph is sequentially <tmath>$\Omega \left( {N^{{{d \over {d+1}}}}} \right)$</tmath>-diagnosable for any fixed <it>d</it>. For hypercubes, symmeteric log <it>N</it>-dimensional grid graphs, it is shown that our algorithm leads to a surprising <tmath>$\Omega \left( {{{{N\,{\rm log\,log}\,N} \over {log\,N}}}} \right)$</tmath> degree of diagnosability. Next we show that the degree of diagnosability of an arbitrary interconnection graph by our algorithm is <tmath>$\Omega \left( {\sqrt {{{N \over \Delta }}}} \right).$</tmath> This bound translates to an <tmath>$\Omega \left( {\sqrt N} \right)$</tmath> degree of diagnosability for cube-connected cycles and an <tmath>$\Omega \left( {\sqrt {{{N \over k}}}} \right)$</tmath> degree of diagnosability for <it>k</it>-ary trees. Finally, we augment our algorithm with another algorithm to show that every topology is <tmath>$\Omega \left( {N^{{{1 \over 3}}}} \right)$</tmath>-diagnosable.</p>