Some relations between massively parallel arrays
Dateien zu dieser Ressource
Datum
1996Autor
Buchholz, Thomas
Kutrib, Martin
Zitierlink
http://dx.doi.org/10.22029/jlupub-1985Zusammenfassung
Relations between various models for massively parallel computers are investigated. These are arrays of finitestate machines -- eventually augmented by pushdown storage -- operating synchronously. The architectures differ mainly in how the input is supplied and how the single nodes are interconnected. The comparisons are made in terms of their ... capabilities to timeconstruct and timecompute functions. That means given an constant input of length n a distinguished cell has to enter distinguished states after f(1); : : : ; f(n) respectively f(n) time steps.