JPDC 1998 - PDF Preprint Papers

JPDC 1998

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JPDC-1998 Paper

click to vote

JPDC
1998

131views more JPDC 1998»

Modeling Free-Space Optical k-ary n-Cube Wormhole Networks

13 years 4 months ago

Download ceng.usc.edu

This paper presents an optical interconnect model for k-ary n-cube network topologies based on freespace analysis. This model integrates relevant parameters inherent to optics wit...

Mongkol Raksapatcharawong, Timothy Mark Pinkston

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	131	Modeling Free-Space Optical k-ary n-Cube Wormhole Networks	claim
2	125	Solving Large-Scale QAP Problems in Parallel with the Search Library ZRAM	claim
3	124	Multilevel k-way Partitioning Scheme for Irregular Graphs	claim
4	78	Parallel Marker-Based Image Segmentation with Watershed Transformation	claim
5	74	A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering	claim
6	73	A Parallel Priority Queue with Constant Time Operations	claim
7	73	Distributed Searching of Multi-dimensional Data: A Performance Evaluation Study	claim
8	68	Transposing Arrays on Multicomputers Using de Bruijn Sequences	claim
9	64	Adaptive Virtual Cut-Through as a Viable Routing Method	claim
10	64	Dynamic Data Distribution and Processor Repartitioning for Irregularly Structured Computations	claim
11	62	Toward a Model for Shared Data Abstraction with Performance	claim
12	61	Efficient Run-Time Support for Irregular Block-Structured Applications	claim
13	58	Parallel Transient Dynamics Simulations: Algorithms for Contact Detection and Smoothed Particle Hydrodynamics	claim
14	54	Lower Bounds for Dynamic Tree Embedding in Bipartite Networks	claim
15	52	A Randomized Parallel Sorting Algorithm with an Experimental Study	claim
16	42	Lock Coarsening: Eliminating Lock Overhead in Automatically Parallelized Object-Based Programs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers