Stephen D. Scott, Sharad Seth, and Ashok Samal. A hardware engine for genetic algorithms. Technical Report UNL-CSE-97-001, University of Nebraska-Lincoln, 1997. ga97bSDScott.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... 784] University of California, 549] University of Cambridge, 110] University of Dortmund, 190, 512, 553] University of Edinburgh, 383] University of Granada, 188, 193] University of Illinois at Urbana Champaign, 119, 325, 544] University of Michigan, 588] University of Nebraska Lincoln, [490, 497] University of San Diego, 113] University of Tampere, 437, 471] University of Vaasa, 137, 339, 340, 341, 342] Universit at Hildesheim, 729] Universit at Karlsruhe, 355] Universit at Osnabr uck, 564] Universit at W urzburg, 399] Universit e McGill, 635] Vanderbilt University, 548, ....

....94, 498] Ryyn anen, Matti, 737] Saarinen, Jukka, 414, 452] Sait, Sadiq M. 806] Saito, Hideo, 724] Sakamoto, Akio, 150] Sakamoto, Jiro, 177] Sakanashi, H. 274, 275] Sakawa, Masatoshi, 805] Sakurai, A. 334] Salami, Mehrdad, 429] Salami, M. 349] Salomon, Ralf, 63] Samal, Ashok, [344, 449, 490, 497, 506] Sampan, S. 82] Sampson, J. R. 695] Sangalli, Nicoletta, 642] Sannomiya, Nobuo, 181, 53] Santib a nez Koref, Ivan, 516, 517, 321] Saravanan, N. 44] Sato, K. 38] Satoh, Hiroshi, 151] Satomi, Susumu, 709] Satyadas, Antony, 413] Scha er, J. David, 259, 130, 260, 131, 261, 132, ....

[Article contains additional citation context not shown here]

Stephen D. Scott, Sharad Seth, and Ashok Samal. A hardware engine for genetic algorithms. Technical Report UNL-CSE-97-001, University of Nebraska-Lincoln, 1997. ga97bSDScott.

.... of California at Berkley, 19] University of Cambridge, 72] University of Durham, 396] University of Edinburgh, 42] University of Granada, 221, 239, 240, 242] University of Illinois at Urbana Champaign, 189, 191, 217, 223, 235, 362, 363, 364, 383, 389] University of Nebraska Lincoln, [108, 322] Patents 13 University of Strathclyde, 390, 391, 392] University of Sussex, 156, 159, 161, 165, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 376] University of Vaasa, 145, 146, 147, 148, 180, 231, 281, 295, 296, 323, 336, 337, 338, 339, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, ....

....F. Van, 84] Rosca, Justinian, 321] Rost, Ursula, 312] Rowe, Jon, 209, 269] Rudnick, M. 13] R uttgers, Martin, 107] Ryan, Conor, 328] Ryyn anen, Matti, 169, 270, 280, 332] Authors 17 Saarinen, Jukka, 213] Saito, Hideo, 21, 25, 30, 34, 53, 54, 69, 76, 77, 78, 83, 110] Samal, Ashok, [48, 108, 322] Samir, Mahfoud W. 238] Samsonova, Maria G. 317] Sanchagrin, Paul C. 106] Sandqvist, Sam, 170, 210, 271] Santib a nez Koref, Ivan, 211, 352, 353, 354] Santos, F. 59] Saravanan, N. 4] Schatz, Michael A. 90, 122] Schmeck, Hartmut, 201, 300] Schultz, Alan C. 10, 38, 51, 64, 140] ....

[Article contains additional citation context not shown here]

Stephen D. Scott, Sharad Seth, and Ashok Samal. A hardware engine for genetic algorithms. Technical Report UNL-CSE-97-001, University of Nebraska-Lincoln, 1997. Key: ga97bSDScott.

.... of Bristol, 211] University of California at Berkley, 18] University of Cambridge, 53] University of Durham, 351] University of Granada, 181, 199, 200, 202] University of Illinois at Urbana Champaign, 148, 150, 177, 183, 195, 317, 318, 319, 338, 344] University of Nebraska Lincoln, [85, 282] University of Strathclyde, 345, 346, 347] University of Sussex, 114, 117, 119, 123, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 331] University of Vaasa, 103, 104, 105, 106, 139, 191, 241, 255, 256, 294, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, ....

....R. 126, 138, 215] Romaniuk, Steve G. 366] Rooij, A. J. F. Van, 64] Rosca, Justinian, 281] Rost, Ursula, 272] Rowe, Jon, 169, 229] Ryan, Conor, 287] Ryynanen, Matti, 127, 230, 240, 291] Saarinen, Jukka, 173] Saito, Hideo, 20, 23, 27, 29, 41, 42, 50, 57, 58, 59, 63, 87] Samal, Ashok, [37, 85, 282] Samir, Mahfoud W. 198] Samsonova, Maria G. 277] Sanchagrin, Paul C. 84] Sandqvist, Sam, 129, 170, 231] Santib a nez Koref, Ivan, 171, 307, 308, 309] Saravanan, N. 4] Schatz, Michael A. 68, 94] Schmeck, Hartmut, 160, 260] Schultz, Alan C. 10, 30, 40, 46, 98] Schwaiger, Roland, ....

[Article contains additional citation context not shown here]

Stephen D. Scott, Sharad Seth, and Ashok Samal. A hardware engine for genetic algorithms. Technical Report UNL-CSE-97-001, University of Nebraska-Lincoln, 1997. Key: ga97bSDScott.

....effective hardware for these tasks. This position is defended in more detail elsewhere [13] This model allows a compromise approach to be taken. While we dictate against dedicated hardware for fitness evaluation (unless suitable functions can be found, examples of which are given by Scott [26]) we do not overlook the possibility of a cohardware software approach. Depending on the mode of GA we are using, the FPGA exists as both a temporal and also a spacial resource for the PE to perform fitness evaluation (Fig 6b) The field of hardware software codesign is encouraging, speed ups on ....

....Key Encoding. This allow us to use standard Crossover and Mutation operators and so preserve the pipelined nature of the dataflow. Random Key encoding is often credited to Bean [31] but similar schemes predate this work [32] Its usefulness to Hardware based GAs was first highlighted by Scott [26]. The method involves encoding a solution using random numbers. Each random number is associated with a traditional gene in an order based representation, such as a city in TSP. This depends on the position of the random number within the chromosome, so that the first number is associated ....

[Article contains additional citation context not shown here]

S. D. Scott, S. Sharad, and S. Ashok. A hardware engine for genetic algorithms. Technical Report UNL-CSE-97-001, University of Nebraska-Lincon, June 1997.

....especially where applications have a large search space or where real time performance is required. Attempts to accelerate the algorithm have been made using both general purpose parallel architectures and special purpose devices via rapid prototyping using Field Programmable Gate Arrays (FPGAs) [2,3]. We have designed a special purpose systolic device for the acceleration of GAs which exploits the inherent parallelism of the genetic operators [4] The design computes in O(N G) time steps using O(N 2 ) cells where N is the population size and G is the length of the chromosomes. The design ....

S. D. Scott, S. Sharad, and S. Ashok. A hardware engine for genetic algorithms. Technical Report UNL-CSE-97-001, University of Nebraska-Lincon, June 1997.

....for a binary chromosome, simply involves flipping a bit from one to zero or visa versa. It is used sparingly to expediate the exploration of the search space. 2.2. Related Work Previous designs for hardware genetic algorithms have been contributed A good overview of the field is given by Scott [6]. A general assumption adopted by these designs is that the problem specific fitness function should be the candidate for hardware implementation as this usually accounts for the majority of processing time. We take a slightly different approach [5] We believe that it is the genetic operators ....

S. D. Scott, S. Sharad, and S. Ashok. A hardware engine for genetic algorithms. Technical Report UNL-CSE-97-001, University of Nebraska-Lincon, June 1997.

....assuming the target fitness function is suitable for hardware implementation and will fit on a single device. Scott et al. have theoretically extended their work by suggesting a range of problems which can be tackled by theirs (and other hardware GAs) and present a good review of the field [17]. Previous work by the authors takes a slightly different approach [18] We believe that it is the genetic operators which are the ideal candidate for hardware implementation due to their regularity and generality. In general fitness functions are best performed by general purpose processors at a ....

S. D. Scott, S. Sharad, and S. Ashok. A hardware engine for genetic algorithms. Technical Report UNL-CSE-97-001, University of Nebraska-Lincon, June 1997.

....Finally, in Section 6 we summarize and review other hardware based GAs. Also available are simulation results, a theoretical analysis of this design, and a description of a proofof concept prototype. They are beyond the scope of this paper and are instead given in an associated technical report [44]. As they become available, updates to the code in this paper will be made available at ftp: ftp.cse.unl.edu pub HGA. Finally, it is important to distinguish hardware based GAs from evolvable hardware. The former (e.g. the design presented in this paper) is an implementation of a genetic ....

....is no longer the sum of the fitnesses of the current population. So a reset places the SM into state idle where it stores the new sof into sum and restarts selection. The HGA is designed to allow for multiple SMs to operate in parallel, which is useful when the SM is the bottleneck of the pipeline [44]. The PS sends the same members to all SMs, but this does not pose a problem for selection since each SM uses an independent pair of random bit strings to scale down the sum of fitnesses. Thus each selection process is independent of the others. All the parallel SMs feed into a single CMM. To add ....

[Article contains additional citation context not shown here]

S. D. Scott, S. Seth, and A. Samal. A hardware engine for genetic algorithms. Technical Report UNL-CSE-97-001, University of Nebraska-Lincoln, July 1997. ftp://ftp.cse.unl.edu/pub/TechReps/UNL-CSE-97-001.ps.gz.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC