Paper Info
Title
Hybrid Genetic Algorithm for Allocation Mapping in Processor Array Design.
Abstract
In this paper a hybrid genetic method for processor arrays design dedicated to realization of linear algebra algorithm for banded matrices is presented. The proposed method is a modification of previous genetic algorithm which is characterized by few important advantages relative to well-known linear projection methods. The main disadvantages of this previous method are: long program runtime and problems with obtaining acceptable allocation mapping results for huge information dependency graphs. Linear projection methods don't allow obtaining better allocation mapping solutions but are characterized by shorter program runtime. New hybrid algorithm combines these both linear and genetic methods and merges their advantages. Summarizing, this new proposed method is characterized by: a shorter program runtime, better allocation mapping results in comparison with both previous methods, possibly allocation mapping for large input linear algebra banded matrices and possibility of defining the designed processor array structure.
Year
DOI
Venue
2013
10.1007/978-3-662-43880-0_34
Lecture Notes in Computer Science
Field
DocType
Volume
Linear algebra,Graph,Genetic method,Hybrid algorithm,Processor array,Matrix (mathematics),Computer science,Parallel computing,Algorithm,Projection (linear algebra),Genetic algorithm
Conference
8353
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
6
1
Name
Order
Citations
PageRank
Piotr Ratuszniak100.68