Implementation of scheduling and allocation algorithm

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a new evolutionary algorithm developed for scheduling and allocation for an elliptic filter. It involves the scheduling of the operations and resource allocation for elliptic filter. The Scheduling and Allocation Algorithm is compared with different scheduling algorithms like As Soon As Possible algorithm, As Late As Possible algorithm, Mobility Based Shift algorithm, FDLS, FDS and MOGS using Elliptic Filter. In this paper execution time and resource utilization is calculated for different Elliptic Filter and reported that proposed Scheduling and Allocation increases the speed of operation by reducing the control step. The proposed work to analyse the magnitude, phase and noise responses for different scheduling algorithm in an elliptic filter. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Marikkannan, S., Leelavathi, Kalaiselvi, U., & Kavitha. (2011). Implementation of scheduling and allocation algorithm. In Communications in Computer and Information Science (Vol. 198 CCIS, pp. 450–459). https://doi.org/10.1007/978-3-642-22555-0_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free