A lookahead arbiter for n-user b-server with non-favorite priority

The paper presents the arbiter design using one level and two level lookahead technique with two step arbitration for N-user B-server case with favorite and non-favorite priorities. The implementation of the proposed arbiter can work more efficiently and faster than the iterative method and is fairer and more complete than pure lookahead technique in the realistic multiprocessor system.<
>