Sciweavers

1095 search results - page 169 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
MICRO
2008
IEEE
88views Hardware» more  MICRO 2008»
15 years 4 months ago
Facelift: Hiding and slowing down aging in multicores
Processors progressively age during their service life due to normal workload activity. Such aging results in gradually slower circuits. Anticipating this fact, designers add timi...
Abhishek Tiwari, Josep Torrellas
INFOCOM
2012
IEEE
13 years 7 days ago
ADAM: An adaptive beamforming system for multicasting in wireless LANs
—We present the design and implementation of ADAM, the first adaptive beamforming based multicast system and experimental framework for indoor wireless environments. ADAM addres...
Ehsan Aryafar, Mohammad Ali Khojastepour, Karthike...
BCB
2010
156views Bioinformatics» more  BCB 2010»
14 years 4 months ago
RepFrag: a graph based method for finding repeats and transposons from fragmented genomes
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
Nirmalya Bandyopadhyay, A. Mark Settles, Tamer Kah...
JAL
2006
101views more  JAL 2006»
14 years 9 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
IWMM
2011
Springer
270views Hardware» more  IWMM 2011»
14 years 21 days 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