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)
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.