Sciweavers

1095 search results - page 166 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
PODC
2005
ACM
15 years 3 months ago
Toward a theory of transactional contention managers
In recent software transactional memory proposals, a contention manager module is responsible for ensuring that the system as a whole makes progress. A number of contention manage...
Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
ISPAN
1999
IEEE
15 years 2 months ago
Evaluation of a Semi-Static Approach to Mapping Dynamic Iterative Tasks onto Heterogeneous Computing Systems
To minimize the execution time of an iterative application in a heterogeneous parallel computing environment, an appropriate mapping scheme is needed for matching and scheduling th...
Yu-Kwong Kwok, Anthony A. Maciejewski, Howard Jay ...
RSP
1999
IEEE
128views Control Systems» more  RSP 1999»
15 years 2 months ago
3-D Floorplanning: Simulated Annealing and Greedy Placement Methods for Reconfigurable Computing Systems
The advances in the programmable hardware has lead to new architectures where the hardware can be dynamically adapted to the application to gain better performance. There are stil...
Kia Bazargan, Ryan Kastner, Majid Sarrafzadeh
DAC
2009
ACM
15 years 10 months ago
Improving testability and soft-error resilience through retiming
State elements are increasingly vulnerable to soft errors due to their decreasing size, and the fact that latched errors cannot be completely eliminated by electrical or timing ma...
Smita Krishnaswamy, Igor L. Markov, John P. Hayes
ADHOC
2008
101views more  ADHOC 2008»
14 years 10 months ago
Monte Carlo localization for mobile wireless sensor networks
Localization is crucial to many applications in wireless sensor networks. In this article, we propose a range-free anchorbased localization algorithm for mobile wireless sensor ne...
Aline Baggio, Koen Langendoen