23 search results - page 2 / 5 » Hypergraphs and Degrees of Parallelism: A Completeness Resul... |
ESA
2009
Springer
15 years 4 months ago
2009
Springer
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
RSA
2011
14 years 4 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
73
Voted
ICPP
1994
IEEE
15 years 1 months ago
1994
IEEE
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
PDP
2009
IEEE
15 years 4 months ago
2009
IEEE
—this paper studies the influence that task placement may have on the performance of applications, mainly due to the relationship between communication locality and overhead. Thi...
ITNG
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper presents several parallel FFT algorithms with different degree of communication overhead for multiprocessors in Network-on-Chip(NoC) environment. Three different method...