Sciweavers

234 search results - page 25 / 47
» An Introduction to Binary Search Trees and Balanced Trees
Sort
View
ICPP
2008
IEEE
15 years 4 months ago
Scalable Dynamic Load Balancing Using UPC
An asynchronous work-stealing implementation of dynamic load balance is implemented using Unified Parallel C (UPC) and evaluated using the Unbalanced Tree Search (UTS) benchmark ...
Stephen Olivier, Jan Prins
PDP
2010
IEEE
15 years 2 months ago
Load Balancing Algorithms with Partial Information Management for the DLML Library
Abstract—Load balancing algorithms are an essential component of parallel computing reducing the response time of applications. Frequently, balancing algorithms have a centralize...
Juan Santana-Santana, Miguel A. Castro-Garcí...
INFOCOM
2006
IEEE
15 years 3 months ago
Optimal Power Allocation in Wireless Networks with Transmitter-Receiver Power Tradeoffs
— For many wireless communication links, such as those employing turbo codes or sequentially-decoded convolutional codes, the power consumption of the decoder at the receiver dep...
Sudarshan Vasudevan, Chun Zhang, Dennis Goeckel, D...
75
Voted
MFCS
2009
Springer
15 years 4 months ago
Branching Programs for Tree Evaluation
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
DAC
2003
ACM
15 years 10 months ago
Automated synthesis of efficient binary decoders for retargetable software toolkits
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...
Wei Qin, Sharad Malik