Periodic scheduling for cache-miss minimisation

MaRDI QIDQ2760874zbMATH OpenFDO

Authors Ramon Antoine Wiro Clout

Publication date 13 December 2001

zbMATH Keywords

cache performanceoptimization problemsscheduling problemsvideo signal processing

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Review text

The subject is the mapping of video algorithms onto processors with caches. The particular problem to be solved is the multi-dimensional periodic cache scheduling. The objective is to minimize the execution time of a video algorithms on each processor by minimizing the number of cache misses. It is described a model for video algorithms allowing a global optimization approach. Moreover, a method is given for efficiently estimating the number of cache misses for a given schedule and a given cache.

Recommendations

• A new approach to optimal cache scheduling
• scientific article; zbMATH DE number 108489
• scientific article; zbMATH DE number 1670647
• Video signal processor scheduling
• The complexity of multidimensional periodic scheduling

Cited in

(4)

• A new approach to optimal cache scheduling
• A dynamic scheduler for the infinite air-cache
• Scheduling to Optimize Cache Utilization for Non-Volatile Main Memories
• Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization

This page was built for publication: Periodic scheduling for cache-miss minimisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760874)