Skip to main content

Conclusions and Future Work

  • Chapter
  • First Online:
  • 550 Accesses

Part of the book series: SpringerBriefs in Applied Sciences and Technology ((BRIEFSINTELL))

Abstract

This work presents a detailed study of the parallelization of a Genetic Algorithm (GA) for pattern discovery using the Symbolic Aggregate approXimation (SAX). The main purpose was to understand the structure of the SAX/GA and if it could benefit from the highly parallel computation that the GPU provides. Each step of the genetic algorithm was analysed thoroughly and, based on a benchmark analysis applied to the sequential SAX/GA, three distinct solutions are proposed, each with its own benefits.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nuno Horta .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 The Author(s)

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Baúto, J., Neves, R., Horta, N. (2018). Conclusions and Future Work. In: Parallel Genetic Algorithms for Financial Pattern Discovery Using GPUs. SpringerBriefs in Applied Sciences and Technology(). Springer, Cham. https://doi.org/10.1007/978-3-319-73329-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73329-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73328-9

  • Online ISBN: 978-3-319-73329-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics