Sciweavers

11 search results - page 2 / 3
» On embeddings of snarks in the torus
Sort
View
ITCC
2005
IEEE
14 years 3 months ago
A RDT-Based Interconnection Network for Scalable Network-on-Chip Designs
The interconnection network plays an important role in the performance and energy consumption of a Networkon-Chip (NoC) system. In this paper, we propose a RDT(2,2,1)/α-based int...
Yang Yu, Mei Yang, Yulu Yang, Yingtao Jiang
SIROCCO
2004
13 years 11 months ago
Two-Hop Virtual Path Layout in Tori
We consider a problem motivated by the design of ATM (Asynchronous Transfer Mode) networks. Given a physical network and an All-to-All traffic, the problem consists in designing a...
Sébastien Choplin, Lata Narayanan, Jaroslav...
ASPLOS
1996
ACM
14 years 1 months ago
Synchronization and Communication in the T3E Multiprocessor
This paper describes the synchronization and communication primitives of the Cray T3E multiprocessor, a shared memory system scalable to 2048 processors. We discuss what we have l...
Steven L. Scott
ICPP
1994
IEEE
14 years 1 months ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
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 ...
Kemal Efe, Antonio Fernández
DCG
2007
102views more  DCG 2007»
13 years 9 months ago
How to Exhibit Toroidal Maps in Space
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
Dan Archdeacon, C. Paul Bonnington, Joanna A. Elli...