Introducing fractal computation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Introducing fractal computation

Résumé

For many problems, like the the Boolean constraint satisfaction problem (SAT), verifying any solution is quite simple while finding one is almost not feasible. Massive parallelism provides a way to test many potential solutions simultaneously but fail when the number of them grows exponentially with the size of the instance to solve. Fractal parallelism proposes a way to cope with this by dispatching this exponential numbers of trials on the first levels of a fractal. Building fractals is not meant to be done on nowadays computers, it relies on an idealization of collision computing: abstract geometrical computation where space and time are continuous and can be effectively subdivided ad libidum; which we introduce.
Fichier non déposé

Dates et versions

hal-00636376 , version 1 (27-10-2011)

Identifiants

  • HAL Id : hal-00636376 , version 1

Citer

Jérôme Durand-Lose. Introducing fractal computation. Coping with Complexity, Oct 2011, Cluj, Romania. ⟨hal-00636376⟩
53 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More