Sciweavers

1024 search results - page 134 / 205
» Complexity and Performance in Parallel Programming Languages
Sort
View
IFIP
1993
Springer
15 years 6 months ago
Plant Engineering: Conceptual Modeling and Modular Design of a Computer Aided Environment
When designing a plant for continuous or semi-continuous processes, such as paper pulp or petrochemical production systems, engineers face very complex tasks, which are only in pa...
Cláudio Walter, José Palazzo M. de O...
JMLR
2012
13 years 4 months ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell
PPOPP
2009
ACM
16 years 3 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
ECOOP
2004
Springer
15 years 7 months ago
Transactional Monitors for Concurrent Objects
Transactional monitors are proposed as an alternative to monitors based on mutualexclusion synchronization for object-oriented programming languages. Transactional monitors have e...
Adam Welc, Suresh Jagannathan, Antony L. Hosking
IWOMP
2009
Springer
15 years 7 months ago
Dynamic Task and Data Placement over NUMA Architectures: An OpenMP Runtime Perspective
Abstract. Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-...
François Broquedis, Nathalie Furmento, Bric...