This paper presents an attempt at an early investigation or exploration of the trade-off between MIPS cost and memory cost. The cost model is an approximation based on knowledge of the application behavior and algorithm inner loop costs for the hardware architecture, which consists of a control processor and a SIMD processor. The application is an H.264 video decoder. Various memory configurati...

Let S be a planar n-point set. Classically, one can find the Voronoi diagram VD(S) for S in O(n log n) time and O(n) space. We study the situation when the available workspace is limited: for s ∈ {1, . . . , n}, an s-workspace algorithm has read-only access to an input array with the points from S in arbitrary order, and it may use only O(s) additional words of Θ(log n) bits for reading and wri...

We study the fundamental problem of sorting in a sequential model of computation and in particular consider the time-space trade-off (product of time and space) for this problem. Beame has shown a lower bound of Ω(n) for this product leaving a gap of a logarithmic factor up to the previously best known upper bound of O(n log n) due to Frederickson. Since then, no progress has been made towards ...

Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental tasks in the population model, such as ...

We consider a heterogeneous distributed service system consisting of n servers with unknown and possibly different processing rates. Jobs unit mean arrive as renewal process rate proportional to are immediately dispatched one several queues associated the servers. assume that dispatching decisions made by central dispatcher ability exchange messages endowed finite memory used store information ...