A HARD REAL-TIME SCHEDULER ALGORITHM FOR SOLID STATE DEVICE | Zendy

РАТНИКОВА И.П. РАТНИКОВА И.П. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A HARD REAL-TIME SCHEDULER ALGORITHM FOR SOLID STATE DEVICE

Author(s) -

РАТНИКОВА И.П. РАТНИКОВА И.П.

Publication year - 2012

Publication title -

international journal of electronics signals and systems

Language(s) - English

Resource type - Journals

ISSN - 2231-5969

DOI - 10.47893/ijess.2012.1079

Subject(s) - computer science , bottleneck , scheduling (production processes) , algorithm , solid state , parallel computing , real time computing , distributed computing , embedded system , mathematical optimization , mathematics , engineering physics , engineering

This paper presents an approach to use the solid state devices in hard real time application where delay in retrieval or write of data to and fro to them can result in a catastrophe. This new algorithm proposes a new approach of scheduling by considering the deadline’s associated with data’s, multiple synchronous read or write requests along with the algorithm for overcoming the problem of performing new block writes resulting in I/O bottleneck.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research