The GF11 supercomputer

Beetem, J.; Denneau, Monty; Weingarten, D.

doi:10.1145/327070.327139

Cited by 82 publications

(19 citation statements)

References 3 publications

(2 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Step (2). Observe that Steps (1b), (1c) and (1d) all make progress in the sense that they reduce either the number of variables or the number of constraints.…”

Section: Letmentioning

confidence: 99%

“…In this paper, we consider two edge coloring problems which have been inspired from study of Clos networks [4] and also generalize classical coloring problems. Clos network were introduced by Clos [4] in the context of designing interconnection networks used to route telephone calls and have found various applications [2,10]. We refer the reader to Correa and Goemans [5] for the relationship between the problems considered here and Clos networks.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Edge Coloring and Decompositions of Weighted Graphs

Feige

Singh

2008

Algorithms - ESA 2008

View full text Add to dashboard Cite

We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given an edge-weighted bipartite graph G = (V, E) with weights w : E → [0, 1]. The task is to find a proper weighted coloring of the edges with as few colors as possible. An edge coloring of the weighted graph is called a proper weighted coloring if the sum of the weights of the edges incident to a vertex of any color is at most one. We give a polynomial time algorithm for the weighted bipartite edge coloring problem which returns a proper weighted coloring using at most 2.25n colors where n is the maximum total weight incident at any vertex. This improves on the previous best bound of Correa and Goemans [5] which returned a coloring using 2.557n + o(n) colors. The second problem we consider is the Balanced Decomposition of Bipartite graphs problem where we are given a bipartite graph G = (V, E) and α 1 , . . . , α k ∈ (0, 1) summing to one. The task is to find a partitionWe give an alternate proof of the result of Correa and Goemans [5] that there is a decomposition such thatMoreover, we show that the additive error can be improved from two to one if only upper bounds or only lower bounds on the degree are present. All our results hold also for bipartite multigraphs, and the decomposition results hold also for general graphs.

show abstract

“…Step (2). Observe that Steps (1b), (1c) and (1d) all make progress in the sense that they reduce either the number of variables or the number of constraints.…”

Section: Letmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Edge Coloring and Decompositions of Weighted Graphs

Feige

Singh

2008

Algorithms - ESA 2008

View full text Add to dashboard Cite

show abstract

“…The computers of the first group in Table 1, the three computers of Columbia [10], two versions of APE [11], QCDPAX [12], GF11 [13] and ACPMAPS [14], were constructed some years ago and have been producing physics results. The characteristics of these computers are given in Table 2.…”

Section: Past and Present Of Dedicated Computersmentioning

confidence: 99%

Computers for lattice field theories

Iwasaki

1994

Nuclear Physics B - Proceedings Supplements

View full text Add to dashboard Cite

Parallel computers dedicated to lattice field theories are reviewed with emphasis on the three recent projects, the Teraflops project in the US, the CP-PACS project in Japan and the 0.5-Teraflops project in the US. Some new commercial parallel computers are also discussed. Recent development of semiconductor technologies is briefly surveyed in relation to possible approaches toward Teraflops computers.

show abstract

“…A non exhaustive list of these problems includes Monte Carlo simulations of Lattice QCD [1,2,3,4], numerical studies of large self-gravitating systems [5] and high-resolution numerical solutions of the Navier-Stokes equations in the turbulent regime [6].…”

Section: Introductionmentioning

confidence: 99%

Ianus: an adaptive FPGA computer

Belletti¹,

Campos

Maiorano

et al. 2006

Comput. Sci. Eng.

View full text Add to dashboard Cite

Dedicated machines designed for specific computational algorithms can outperform conventional computers by several orders of magnitude. In this note we describe Ianus, a new generation FPGA based machine and its basic features: hardware integration and wide reprogrammability. Our goal is to build a machine that can fully exploit the performance potential of new generation FPGA devices. We also plan a software platform which simplifies its programming, in order to extend its intended range of application to a wide class of interesting and computationally demanding problems. The decision to develop a dedicated processor is a complex one, involving careful assessment of its performance lead, during its expected lifetime, over traditional computers, taking into account their performance increase, as predicted by Moore's law. We discuss this point in detail.

show abstract

The GF11 supercomputer

Cited by 82 publications

References 3 publications

Edge Coloring and Decompositions of Weighted Graphs

Edge Coloring and Decompositions of Weighted Graphs

Computers for lattice field theories

Ianus: an adaptive FPGA computer

Contact Info

Product

Resources

About