Sciweavers

100 search results - page 13 / 20
» Optimising Graph Partitions Using Parallel Evolution
Sort
View
JPDC
2007
177views more  JPDC 2007»
13 years 7 months ago
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
Cevdet Aykanat, Berkant Barla Cambazoglu, Ferit Fi...
IEEEPACT
2002
IEEE
14 years 18 days ago
A Framework for Parallelizing Load/Stores on Embedded Processors
Many modern embedded processors (esp. DSPs) support partitioned memory banks (also called X-Y memory or dual bank memory) along with parallel load/store instructions to achieve co...
Xiaotong Zhuang, Santosh Pande, John S. Greenland ...
ICDCS
2005
IEEE
14 years 1 months ago
Resource-Aware Distributed Stream Management Using Dynamic Overlays
We consider distributed applications that continuously stream data across the network, where data needs to be aggregated and processed to produce a 'useful' stream of up...
Vibhore Kumar, Brian F. Cooper, Zhongtang Cai, Gre...
PODC
2010
ACM
13 years 11 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
IPPS
1998
IEEE
13 years 12 months ago
Multiprocessor Architectures Using Multi-Hop Multi-OPS Lightwave Networks and Distributed Control
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. In this paper we p...
David Coudert, Afonso Ferreira, Xavier Muño...