The measured performance of a fast local IPC

Protected application decomposition is limited by the performance of the local interprocess procedure call implementation. In this paper we measure the performance of a new IPC implementation, and show that the cost of IPC can be reduced to the cost of raw memory copy plus a small overhead. Even on machines with poor context switching performance, our implementation compares favorably with bcopy() for surprisingly small payloads.