|
Analysis and Refining of Scheduler
for Real-Time Operating System
-- M V Panduranga Rao and K C Shet
Implementing a new scheduling algorithm in an OS kernel is often an important step in scheduling research because
it permits evaluation of the algorithm's performance on real workloads. However, developing a new scheduler is not a
trivial task because it requires sophisticated programming skills and a deep knowledge of kernel internals. This paper
describes our work towards a rapid prototyping system for hard real-time systems focusing on scheduling algorithms and
scheduler implementations. The framework aims at speeding up the decision making process during selection of a suitable
scheduling algorithm for a real-time application. In this research paper, the comparison of different preemptive scheduling
algorithms is carried out. Hence, by extracting the positive features of each of the generic preemptive scheduling policies, a
new parametric scheduling policy is developed. It is expected that the new scheduling algorithm will give better
performance with respect to satisfying the needs, such as response time, waiting time and turnaround time.
© 2009 IUP. All Rights Reserved.
PGP Using Chebyshev Polynomials
-- B Tirimula Rao,
P Srinivasu, Chukka Anantha Rao,
Kanduri Satya Vivek Vardhan and Jami Vidyadhari
This paper presents a novel idea of achieving higher degree of privacy for e-mails using Chebyshev polynomials for
`Pretty Good Privacy' (PGP) (Kenneth and Ballou, 2005). The strength of polynomials lies in their chaotic properties which
are potentially suitable for cryptography. A brief discussion on how these polynomials are helpful in providing good
security is also presented and the security strengths are evaluated.
© 2009 IUP. All Rights Reserved.
Extracting Equations for Actual
Execution Times of Some Frequently
Used Sorting Algorithms
-- Pinaki Chakraborty
Ten common sorting algorithms were implemented and executed on a computer with Intel Pentium-4 running the
Microsoft Windows XP operating system. Best case and worst case analyses of the algorithms were performed for lists of 1,000
to 10,000 integers. An improved version of bubble sort algorithm and the recursive quick sort algorithm were the fastest in
the best case and the worst case, respectively. Equations for the execution times were also extracted from this analysis.
The results displayed the actual performance of the algorithms on the given platform. The results of this study can be used
to predict the execution time of these algorithms for an input of arbitrary size. Moreover, the results can be used to
compare the performances of new sorting algorithms with those of the existing ones. The study also shows that an algorithm
whose execution time is bound by a loose asymptotic limit may run faster than an algorithm whose execution time is bound by
a stricter asymptotic limit. This signifies the need to study the actual execution times of algorithms on different hardware
and software platforms.
© 2009 IUP. All Rights Reserved.
Propagation Behavior of Computer Virus
in the Framework of SIR Model
-- N Suresh Rao, Devanand and P S Avadhani
This research paper describes the dynamics of propagation of computer virus in a network of computers based on
the mathematical epidemiological model, Susceptible-Infected-Removed (SIR) model. The asymptotic behavior of
susceptible, infected and removed nodes is examined. The threshold phenomena of growth and fall of infective nodes, based on
the initial number of susceptible nodes and effective removal rate, is investigated. Further, the Kermack-McKendrick
(K-M) epidemic theorem's prediction is examined under certain approximations and also a measure of intensity of the
epidemic is shown.
© 2009 IUP. All Rights Reserved.
Multiserver Approach for Large-Scale Secure
Multicast in Wireless Environments
-- V Vasudevan and R Sukumar
This paper proposes a multiserver architecture for group key management to minimize the overall system bandwidth.
The proposed system utilizes the dynamic split and merge with a low overhead where a physical server adaptively splits
and merges its traffic into multiple groups, each served by a logical server so as to minimize its total bandwidth. The
performance of this proposed approach is compared with that of the single-server case. The results show that multiserver
architecture scales well when compared with the single-server approach.
© 2009 IUP. All Rights Reserved.
Transition Networks for the Processing
of Sanskrit Text for Identification
of Case Endings
-- Smita Selot, Neeta Tripathi and A S Zadgaonkar
Processing of the language for extraction of semantic is a challenge in the field of artificial intelligence. Work is
being carried out in most of the Indian languages, and Sanskrit being the ancient of all, has a great potential in the
extraction process. As given in the grammar of Sanskrit language, its case endings are strong identifiers of the respective word in
the sentence. These features are used for identifying the thematic role of a word in a sentence. The problem lies in
developing a system with these capabilities. Generally a complete database of all such suffixes is maintained, and then these
databases are mapped with each word to identify it as a noun, pronoun, verb and adjective. However, search time in these is
very large. This paper presents the design of the system which processes the suffix with the help of the type of net, similar to
the transition net for identification purpose. Such extraction features help in representation of knowledge using
Sanskrit language.
© 2009 IUP. All Rights Reserved.
RESEARCH NOTE
Approaches of the WinRunner and LoadRunner
Software Testing Tools: A Case Study
-- Anisha Kumar
© 2009 IUP. All Rights Reserved.
|
