Sciweavers

63 search results - page 8 / 13
» Randomized Optimal Design of Parallel Manipulators
Sort
View
SPAA
2009
ACM
14 years 8 months ago
Brief announcement: selfishness in transactional memory
In order to be efficient with selfish programmers, a multicore transactional memory (TM) system must be designed such that it is compatible with good programming incentives (GPI),...
Raphael Eidenbenz, Roger Wattenhofer
HPCA
2011
IEEE
12 years 11 months ago
Essential roles of exploiting internal parallelism of flash memory based solid state drives in high-speed data processing
Flash memory based solid state drives (SSDs) have shown a great potential to change storage infrastructure fundamentally through their high performance and low power. Most recent ...
Feng Chen, Rubao Lee, Xiaodong Zhang
SG
2010
Springer
13 years 5 months ago
An Interactive Interface for Lighting-by-Example
Lighting design in computer graphics is essentially not a random process but one driven by both a technical and aesthetic appreciation of lighting. In some applications, the result...
Hai Nam Ha, Christophe Lino, Marc Christie, Patric...
MST
2000
57views more  MST 2000»
13 years 7 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
PC
2007
161views Management» more  PC 2007»
13 years 7 months ago
High performance combinatorial algorithm design on the Cell Broadband Engine processor
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
David A. Bader, Virat Agarwal, Kamesh Madduri, Seu...