Sciweavers

1792 search results - page 255 / 359
» Improved scheduling in rings
Sort
View
ICALP
2011
Springer
14 years 2 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
IWMM
2011
Springer
270views Hardware» more  IWMM 2011»
14 years 2 months ago
Memory management in NUMA multicore systems: trapped between cache contention and interconnect overhead
Multiprocessors based on processors with multiple cores usually include a non-uniform memory architecture (NUMA); even current 2-processor systems with 8 cores exhibit non-uniform...
Zoltan Majo, Thomas R. Gross
SPAA
2012
ACM
13 years 1 months ago
A scalable framework for heterogeneous GPU-based clusters
GPU-based heterogeneous clusters continue to draw attention from vendors and HPC users due to their high energy efficiency and much improved single-node computational performance...
Fengguang Song, Jack Dongarra
TMC
2012
13 years 1 months ago
Relay-Assisted Transmission with Fairness Constraint for Cellular Networks
Abstract—We consider the problem of relay-assisted transmission for cellular networks. In the considered system, a source node together with n relay nodes are selected in a propo...
Erwu Liu, Qinqing Zhang, Kin K. Leung
ICIP
2006
IEEE
16 years 26 days ago
Autonomous Detection of Dust Devils and Clouds on Mars
Acquisition of science in space applications is shifting from teleoperated gathering to an automated on-board analysis with improvements in the use of on-board memory, CPU, bandwi...
Alex Fukunaga, Andres Castano, Jeffrey J. Biesiade...