221 search results - page 24 / 45 » Analyzing the Implicit Computational Complexity of object-or... |
114
click to vote
EUROPAR
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Today’s parallel computers with SMP nodes provide both multithreading and message passing as their modes of parallel execution. As a consequence, performance analysis a...
70
Voted
EUROPAR
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...
111
click to vote
PPDP
2010
Springer
14 years 8 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
EICS
2009
ACM
15 years 4 months ago
2009
ACM
Smart environments (e.g., airports, hospitals, stadiums, and other physical spaces using ubiquitous computing to empower many mobile people) provide novel challenges for usability...
116
click to vote
ICPADS
1994
IEEE
15 years 1 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...