Sciweavers

1291 search results - page 234 / 259
» Arithmetic program paths
Sort
View
JPDC
2006
111views more  JPDC 2006»
13 years 8 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader
IJRR
2007
181views more  IJRR 2007»
13 years 8 months ago
Optimal Rough Terrain Trajectory Generation for Wheeled Mobile Robots
An algorithm is presented for wheeled mobile robot trajectory generation that achieves a high degree of generality and efficiency. The generality derives from numerical lineariza...
Thomas M. Howard, Alonzo Kelly
TCAD
2008
93views more  TCAD 2008»
13 years 8 months ago
Chip Optimization Through STI-Stress-Aware Placement Perturbations and Fill Insertion
Starting at the 65-nm node, stress engineering to improve the performance of transistors has been a major industry focus. An intrinsic stress source--shallow trench isolation (STI)...
Andrew B. Kahng, Puneet Sharma, Rasit Onur Topalog...
TMC
2008
136views more  TMC 2008»
13 years 8 months ago
Efficient Resource Allocation for Wireless Multicast
In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by...
De-Nian Yang, Ming-Syan Chen
TPDS
2008
72views more  TPDS 2008»
13 years 8 months ago
Replica Placement and Access Policies in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
Anne Benoit, Veronika Rehn-Sonigo, Yves Robert