Efficient Method for Modeling Contiguous Buffer Allocations
Original Publication Date: 1988-Jan-01
Included in the Prior Art Database: 2005-Feb-14
When using most simulation languages, it is simple to model a resource with a capacity greater than one. The representation of the resource allows transactions to seize the resource, one at a time or in groups. This assumes that all copies of the resource are equivalent and, as long as a transaction can seize the necessary number of resources, a request for resources can be satisfied. However, if resources must be seized in a specific order or if they need to be contiguous, the resources built into most simulation languages will not handle these special cases. To represent these cases of resources, additional logic describing the resource must be added to a model. This article describes a simple method of representing a resource where the resources that are seized must be contiguous.