Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

107

Voted

JPDC
2002

46views more JPDC 2002»

Optimal and Efficient Algorithms for Summing and Prefix Summing on Parallel Machines

15 years 2 months ago

Optimal and Efficient Algorithms for Summing and Prefix Summing on Parallel Machines

Download www.csie.ntust.edu.tw

Eunice E. Santos

Real-time Traffic

JPDC 2002 |

claim paper

Related Content

» EnergyEfficient MultiCarrier Link Adaptation with Sum RateDependent Circuit Power

» Optimization of linked list prefix computations on multithreaded GPUs using CUDA

» Estimation in Gaussian Graphical Models Using Tractable Subgraphs A WalkSum Analysis

» A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines

» Preemptive Scheduling with Rejection

» Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines

» Optimal Broadcast and Summation in the LogP Model

» The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

» Extensible programming with firstclass cases

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	JPDC
Authors	Eunice E. Santos

Comments (0)