Sciweavers

904 search results - page 167 / 181
» Scheduling task graphs optimally with A
Sort
View
ICCAD
1993
IEEE
104views Hardware» more  ICCAD 1993»
13 years 11 months ago
Parallel timing simulation on a distributed memory multiprocessor
Circuit simulation is one of the most computationally expensive tasks in circuit design and optimization. Detailed simulation at the level of precision of SPICE is usually perform...
Chih-Po Wen, Katherine A. Yelick
ASPLOS
2006
ACM
13 years 11 months ago
Accurate and efficient filtering for the Intel thread checker race detector
Debugging data races in parallel applications is a difficult task. Error-causing data races may appear to vanish due to changes in an application's optimization level, thread...
Paul Sack, Brian E. Bliss, Zhiqiang Ma, Paul Peter...
CSCW
2008
ACM
13 years 9 months ago
Cutting into collaboration: understanding coordination in distributed and interdisciplinary medical research
Coordinating goals, schedules, and tasks among collaborators is difficult, and made even more so when there are disciplinary, geographic and institutional boundaries that must be ...
Saeko Nomura, Jeremy P. Birnholtz, Oya Rieger, Gil...
ISCAPDCS
2003
13 years 8 months ago
Performance Monitoring of N-tier Client/Server Systems
Despite the widespread deployment of client/server technology, there seem to be no tools currently available that are adequate for analyzing and tuning the performance of client/s...
Christoph Steigner, Jürgen Wilke
JAIR
2007
141views more  JAIR 2007»
13 years 7 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf