{"componentChunkName":"component---src-templates-post-template-js","path":"/posts/operatingsystems/multiprocessor-scheduling","result":{"data":{"markdownRemark":{"id":"262dae22-2d46-58ec-a7da-c39d3db15fda","html":"

Bankers Algorithm

\n\n

Precise Exceptions

\n

At the time that an exception handler begins execution, there is a well-defined instruction\naddress in the instruction stream for which all prior instructions have committed their results and no following instructions (including the excepting one) have modified processor state.

\n

Meltdown Security Flaw

\n

Many processors allowed timing windows in which illegal accesses could be performed\nspeculatively and made to impact cache state – even though the speculatively loaded data\nwas later squashed in the pipeline and could not be directly used.

\n

Earliest Deadline First(EDF) scheduler

\n\n

Beladys anomaly

\n","fields":{"slug":"/posts/operatingsystems/multiprocessor-scheduling","tagSlugs":["/tag/notes/","/tag/operating-system/"]},"frontmatter":{"date":"2021-10-11T23:46:37.121Z","description":"Notes on the different types of scheduling systems for multiprocessors","tags":["Notes - ","Operating System"],"title":"Multiprocessor Scheduling"}}},"pageContext":{"slug":"/posts/operatingsystems/multiprocessor-scheduling"}},"staticQueryHashes":["251939775","401334301","825871152"]}