Sciweavers

7716 search results - page 19 / 1544
» Can I pass
Sort
View
DAC
1999
ACM
14 years 7 months ago
Hypergraph Partitioning with Fixed Vertices
We empirically assess the implications of fixed terminals for hypergraph partitioning heuristics. Our experimental testbed incorporates a leading-edge multilevel hypergraph partit...
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko...
EGH
2004
Springer
14 years 4 days ago
Mio: fast multipass partitioning via priority-based instruction scheduling
Real-time graphics hardware continues to offer improved resources for programmable vertex and fragment shaders. However, shader programmers continue to write shaders that require ...
Andrew Riffel, Aaron E. Lefohn, Kiril Vidimce, Mar...
CLUSTER
2009
IEEE
14 years 1 months ago
Message passing for GPGPU clusters: CudaMPI
—We present and analyze two new communication libraries, cudaMPI and glMPI, that provide an MPI-like message passing interface to communicate data stored on the graphics cards of...
Orion S. Lawlor
APLAS
2009
ACM
14 years 1 months ago
Proving Copyless Message Passing
Handling concurrency using a shared memory and locks is tedious and error-prone. One solution is to use message passing instead. We study here a particular, contract-based flavor ...
Jules Villard, Étienne Lozes, Cristiano Cal...
PDPTA
2003
13 years 8 months ago
Mobile Agents for Pervasive Computing Using a Novel Method of Message Passing
- Pervasive computing is an emerging technology that brings new dimensions to distributed computing; it uses a wide variety of smart, ubiquitous devices throughout an individual’...
David Levine, Renjith Thomas, Farhad Kamangar, Ger...