Sciweavers

475 search results - page 91 / 95
» Feasible distributed CSP models for scheduling problems
Sort
View
PPOPP
2011
ACM
14 years 8 months ago
GRace: a low-overhead mechanism for detecting data races in GPU programs
In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel program...
Mai Zheng, Vignesh T. Ravi, Feng Qin, Gagan Agrawa...
IEEEPACT
2002
IEEE
15 years 10 months ago
A Framework for Parallelizing Load/Stores on Embedded Processors
Many modern embedded processors (esp. DSPs) support partitioned memory banks (also called X-Y memory or dual bank memory) along with parallel load/store instructions to achieve co...
Xiaotong Zhuang, Santosh Pande, John S. Greenland ...
176
Voted
APSEC
2001
IEEE
15 years 9 months ago
Orchestrating Computations on the World-Wide Web
Word processing software, email, and spreadsheet have revolutionized office activities. There are many other office tasks that are amenable to automation, such as: scheduling a vi...
Jayadev Misra, Harrick M. Vin
178
Voted
ATAL
2005
Springer
15 years 11 months ago
A logic for strategic reasoning
Rational strategic reasoning is the process whereby an agent reasons about the best strategy to adopt in a given multi-agent scenario, taking into account the likely behaviour of ...
Wiebe van der Hoek, Wojciech Jamroga, Michael Wool...
CONCURRENCY
2000
123views more  CONCURRENCY 2000»
15 years 5 months ago
A mobile agent based push methodology for global parallel computing
The 1990s are seeing the explosive growth of the Internet and Web-based information sharing and dissemination systems. The Internet is also showing a potential of forming of a sup...
Cheng-Zhong Xu, Brian Wims