Abstract: Operating System is playing a major role now-a-days. Operating System acts as a interface between hardware and user. So when number of processes are increased and resources are in limited state then deadlock occurs .To avoid deadlock we have different approaches like dining – philosopher problem one of the approach to omit deadlock concept. In this paper we focus mainly on obtaining deadlock free solution to the dining – philosopher problem. The solution mainly imposes the restriction that a philosopher may only pick the chopsticks if both of them are available. RUST and GO system programming language are used in the coding part. In this paper we also try to justify why Go is widely used than Rust by providing the values for following details program source code details , CPU Seconds, Elapsed seconds, Memory KB Code B and CPU Load.
Keywords: RUST, GO, dining – philosopher problem, program source code, CPU Seconds, Elapsed seconds, Memory KB Code B, CPU Load.