This paper proposes a new scheduler applying the concept of non-uniform laxity to Earliest Deadline First (EDF) approach for aperiodic tasks. This scheduler improves task utilisation (Execution time / deadline) and also increases the number of tasks that are being scheduled. Laxity is a measure of the spare time permitted for the task before it misses its… (More)
Scheduling of tasks takes into account the priority of the tasks and the available laxity among other factors. Laxity is a measure of slack time. Generally, the available slack time is cumulated and uniformly distributed among all tasks, irrespective of priority. However, a better approach would be to distribute the slack time to tasks in proportion to… (More)
This paper presents a fuzzy based modeling approach for determining the effectiveness of IT security policies of an organization. Normally organizations have different IT security policies, but modeling and maintaining them is a tedious process. In order to ensure appropriate IT support policies, there are many factors involved. The most common are the… (More)
This paper proposes a scheduler combining the concepts of EDF and pfairness using the worst fit heuristic function. In scheduling algorithms without pfairness, priority is not monitored closely in case of preemptions. An algorithm combining EDF and pfairness proposed in this paper overcomes this drawback. Here resources are granted in accordance to the task… (More)
In elliptic curve cryptography, the problem of computing an integer k from two points on the ellipse namely kp, p the computation of ap+bq+cr+ds, is performed from Shamir's method. In this paper an algorithm is proposed for computing the minimum joint weight for the integers a, b, c, d, examining them from left to right.