Loading ...
Sorry, an error occurred while loading the content.

Extended deadline PABA 2011 + Special Issue

Expand Messages
  • Francisco Fernandez de Vega
    [Apologies if you got multiple copies of this email] ****************************** **************************************************** CALL FOR PAPERS -
    Message 1 of 1 , Aug 1, 2011
    • 0 Attachment
      [Apologies if you got multiple copies of this email]

      CALL FOR PAPERS -  Extended deadline

      Due to numerous requests, we have extended the Deadline (see below).

      Fourth Workshop on Parallel Architectures and Bioinspired Algorithms
      (WPABA 2011)
      To be held in conjunction with The Twentieth International Conference
      on Parallel Architectures and Compilation Techniques (PACT) Galveston
      Island, Texas, USA, October 10-14, 2011.
      Accepted papers will be published in separated proceedings handed out
      during the workshop.

      *****Extended version of selected papers will be published in a special
      Impact Factor 0.907).****


      Knowledge fields like Parallel Computer Architectures, Parallel and
      Distributed Computing and Bioinspired Algorithms, many different in a
      first approach, are able to find transversal elements that enrich
      them. Therefore, the aim of this fourth workshop is to support any
      proposal that traverses these fields. Bioinspired Algorithms comprise
      a set of heuristics that can help to optimize a wide range of
      problems. Among them, many tasks that parallel architecture designers
      develop may be optimized. In addition, Bioinspired Algorithms may help
      finding solutions regarding compilation and resource sharing issues,
      which are interesting problems for parallel architectures. Parallel
      architecture designers may also propose infrastructures that allow the
      increase of computing performance of Bioinspired Algorithms, which
      usually face real-world problems that manage huge amounts of data.
      Alternatives to the classical sequential solution are needed by this
      The topics include, but are not limited to:
       *  Evolutionary Algorithms for Parallel Computer Architectures optimization.
       *  Computer Architecture optimizations using other biologically
      inspired algorithms: Ant Colonies, Immune Systems, Artificial Life,
      Cultural Algorithms, etc…
       *  Cluster and Grid Deployment of Bioinspired Algorithms.
       *  Desktop Grids infrastructures for supporting Bioinspired Algorithms.
       *  Large Scale Parallel Processing.
       *  Heterogeneous Computing Platforms for Bioinspired Algorithms.
       *  Improvement on scheduling techniques by means of Bioinspired Algorithms.
       *  Fault tolerant implementations of PEAs.
       *  Performance evaluation of PEAs.
       *  Improvement in system performance through optimization and tuning.
       *  Parallel Reconfigurable Architectures for Bioinspired Algorithms.
       *  Graphics processing units and Evolutionary Algorithms.
       *  Profiting from Cloud infrastructure when running Bioinspired Algorithms.
      As in past editions of the workshop, papers will be double blinded
      reviewed by an international scientific committee.

      Important dates

       *  Paper Submission: August 10th
       *  Decision Notifications: September 10th
       *  Camera-Ready Submission: September 17th
       *  Conference Dates: October 10th-14th

      More information at the WPABA 2011 website:


      EvoPAR 2012 http://www.cs.ucl.ac.uk/staff/W.Langdon/evopar


      Dr. Francisco Fernández de Vega.
      Senior Member IEEE.

      Titular de Universidad.  Associate Professor.
      Departamento de Tecnología de los Computadores y de las Comunicaciones.
      Universidad de Extremadura.
      Tf:    924 38 70 68
      Fax: 924 30 37 82
      Centro Universitario de Mérida.
      C/Sta. Teresa de Jornet, 38.
      06800 Mérida - Badajoz.

      e-mail: fcofdez@...
    Your message has been successfully submitted and would be delivered to recipients shortly.