A genetic algorithm approach to scheduling communications for a class of parallel space-time adaptive processing algorithms

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

Abstract

An important consideration in the maximization of performance in parallel processing systems is scheduling the communication of messages during phases of data movement to reduce network contention and overall communication time. The work presented in this paper focuses on off-line optimization of message schedules for a class of radar signal processing techniques know as space-time adaptive processing on a parallel embedded system. In this work, a genetic-algorithm-based approach for optimizing the scheduling of messages is introduced. Preliminary results indicate that the proposed genetic approach to message scheduling can provide significant decreases in the communication time. © 2000 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

West, J. M., & Antonio, J. K. (2000). A genetic algorithm approach to scheduling communications for a class of parallel space-time adaptive processing algorithms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1800, 855–861. https://doi.org/10.1007/3-540-45591-4_117

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