This paper presents the TickerTAIP architecture and an evaluation of its behavior. We demonstrate the feasibility by an existence proof; describe a family of distributed algorithms for RAID parity calculation; discuss techniques for establishing request atomicity, sequencing and recovery; and provide a performance evaluation of the TickerTAIP design space in both absolute terms and by comparison to a centralized RAID implementation. We conclude that the TickerTAIP architectural approach is feasible, useful, and effective. *Princeton University, Princeton, NJ, **University of Illinois, Urbana-Champaign, IL, ***University of Wisconsin, Madison, WI Also published as Operating Systems Research Department report HPL-OSR-92-6 1