Abstract

With recent declines m the cost of semiconductor memory and the mcreasmg need for high performance I/O disk systems, It makes sense to consider the design of large caches In this paper, we consider the effect of caching writes We show that cache sizes m the range of a few percent allow writes to be performed at neghglble or no cost and mdependently of locahty conslderatlons

No abstract

Abstract. A recent paper presented an access control scheme for discretionary access controls with a decidable safety problem. This paper deals with the complexity analysis of that access control, and finds it to be, in its worst cases, PSPACE-complete, but polynomial time for practical cases. The PSPACE-hardness reduction uses the theory of succinct problems in a more general manner than circuit representation.

No abstract