Statement of Purpose

Of the many fields in computer Science spectrum, I am interested in theoretical Computer

Science. My main interest is in Design, Analysis and implementation of parallel
scheduling algorithm. Scheduling problems is one of the great challenging problems in
parallel computing. Since an inappropriate scheduling of the tasks can fail to exploit the
true potential of the system and can offset the gain from parallelization. I am excited with
enormous potential of research in this area. I also hold interest in Formal language and
Automata theory.
I was advised to focus on scheduling theory by my supervisor in my M.Tech dissertation
course. I did extensive survey on existing scheduling techniques and supporting tools for
parallel system by thoroughly investigating reputed journals of parallel computing such
TDS-IEEE Transactions on parallel and distributed systems, TOCS-ACM Transactions
on computer science and PC -Parallel computing. I identified various issues and aspects
of Scheduler design such as system architecture, work load types, metrics, simulation
tools, benchmarks and load balancing in parallel computing. I found that there are three
preliminary goals to measure task scheduling performance i.e.
G1: The complexity should be low.
G2: The parallel time should be minimized
G3: The efficiency should be maximized.
Conflict may arise in order to meet all the above goals G1, G2 and G3. When there is a
conflict in the maximization of efficiency with the minimization of parallel time G1 is
given priority over G2 and G3 and G2 over G3. I learnt that finding an optimum solution
of scheduling problem is NP-Complete in its general form. Moreover, in my dissertation,
I tried to propose a modified scheduling policy that will request parallel application to
achieve target efficiency with balanced load on all available processors. I have also
presented few papers on these issues in local conferences. Working one-on-one with
senior faculty member (my supervisor), I gained skilled and knowledge that are not easily
earned just read about research. This experience provide me with the opportunity to think,
organize information, problem solve and demonstrate my commitment, reliability and
capacity for research.
I believe teaching is integral part of doing research. A discovery is far from complete if
one does not find a way to present it. I have been teaching various subjects including data
structure, Design and analysis of algorithm, automata theory and discrete mathematics in
the University course since 2003. As teaching the subject is the best way of learning the
subject, I have in depth knowledge of those core subjects in computer science. I am also
guiding M.tech/M.C.A/B.Tech students in their dissertations work has kept my thrust in
research alive. I have published three papers in conference guiding M.Tech students. A
PhD is a depth research exploration of one topic. I strongly believe that I am mature
enough to figure out a problem and work on only one narrow problem. I have tremendous
perseverance and capable of hard work to complete my graduate studies in time with
distinction.

In reviewing the research interest and publications of Ottawa/ Carleton faculty of

Computer Science, I have found my objectives in accordance with interests of Prof. Anil
Maheshwari, School of computer science Carleton University, considering his research
interest and outstanding publications in Design and Implementations of algorithms. I
believe that to be associated with faculty of your department for some years of my PhD
would stand in me good start for my research and teaching career.
Higher authority of my University has encouraged me to pursue PhD in your department
by considering my application for study leave in the event of selection. I look forward to
joining Ottawa/Carleton University as a graduate student at your esteemed department.