A flexible simulation framework for multicore schedulers

Aravind, Alex; Manickam, Viswanathan

doi:10.1145/2486092.2486140

Cited by 1 publication

(1 citation statement)

References 12 publications

(14 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence we have used Linux Completely Fair Scheduler, implemented by Manickam V. [3]. Simulation of a machine simply refl ects the simulation of t he multicore system in it, t herefore we have used that component with our system .…”

Section: Scheduler and Machinementioning

confidence: 99%

A flexible simulaton framework for the study of deadlock resolution algorithms in multicore systems

Desai¹

View full text Add to dashboard Cite

Deadlock is a common phenomenon in software applications, yet it is ignored by most operating systems. Although the occurrence of a deadlocks in systems is not frequent , in some cases , the effects are drastic when deadlock occurs. The ongoing trend in processor technology indicates that future systems will have hundreds and thousands of cores. Due to this imminent trend in hardware development , the problem of deadlock has gained renewed attention in research. Deadlock handling techniques that are developed for earlier processors and distributed systems might not work well with multicore systems, due to their architectural differences. Hence, to maximize the utility of multicore systems , new programs have to be carefully designed and tested before they can be adopted for practical use. Many approaches have been developed to handle deadlock in multicore systems, but very little attention has been paid to comparing the performance of those approaches with respect to different performance parameters.To fulfil the above mentioned shortfalls, we need a flexible simulation testbed to study deadlock handling algorithms and to observe their performance differences in multicore systems. The development of such a framework is the main goal of this thesis. In the framework, we implemented a general a scenario, scenario for the Dining Philosopher 's problem and scenario for the Banker's algorithm. In addition to these scenarios, we demonstrate the flexibility, soundness, and use of the proposed framework by simulating two different deadlock handling strategies -deadlock avoidance (the Banker 's algorithm) and deadlock detection (Dreadlocks). The deadlock detection is followed by deadlock recovery to resolve the detected deadlock. We also present result analysis for the different set of experiments performed on the implemented strategies. The proposed simulation testbed to study deadlocks in multicore systems is developed using Java.

show abstract

Section: Scheduler and Machinementioning

confidence: 99%

A flexible simulaton framework for the study of deadlock resolution algorithms in multicore systems

Desai¹

View full text Add to dashboard Cite

show abstract

A flexible simulation framework for multicore schedulers

Cited by 1 publication

References 12 publications

A flexible simulaton framework for the study of deadlock resolution algorithms in multicore systems

A flexible simulaton framework for the study of deadlock resolution algorithms in multicore systems

Contact Info

Product

Resources

About