• Post Reply Bookmark Topic Watch Topic
  • New Topic
programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other Pie Elite all forums
this forum made possible by our volunteer staff, including ...
Marshals:
  • Campbell Ritchie
  • Jeanne Boyarsky
  • Ron McLeod
  • Paul Clapham
  • Liutauras Vilda
Sheriffs:
  • paul wheaton
  • Rob Spoor
  • Devaka Cooray
Saloon Keepers:
  • Stephan van Hulst
  • Tim Holloway
  • Carey Brown
  • Frits Walraven
  • Tim Moores
Bartenders:
  • Mikalai Zaikin

what is the preferred data structure for Rate monolithic scheduling algorithms and why?

 
Greenhorn
Posts: 3
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
I have seen CPU scheduling algorithms (Rate monolithic - Real time CPU scheduling) or priority scheduling using array data structure

http://c-programmingguide.blogspot.in/2012/09/c-program-for-rate-monotonic-scheduling.html

But I would like to know if this is the preferred data structure if yes why OR if any data struture is preferred for RMS then which one is better and why

any suggestions would be appreciated

Thanks in advance
reply
    Bookmark Topic Watch Topic
  • New Topic