We present a direct implementation of the shift and reset control operators in the Scheme 48 system. The new implementation improves upon the traditional technique of simulating shift and reset via call/cc. Typical applications of these operators exhibit space savings and a significant overall performance gain. Our technique is based upon the popular incremental stack/heap strategy for representing continuations. We present implementation details as well as some benchmark measurements for typical applications. Categories and Subject Descriptors D.3.3 [Programming Languages]: Language Constructs and Features--Control structures General Terms Languages, Performance Keywords Continuations, Implementation, Scheme