Sciweavers

1732 search results - page 9 / 347
» New Challenges in Parallel Optimization
Sort
View
IPPS
2000
IEEE
14 years 6 days ago
Buffered Coscheduling: A New Methodology for Multitasking Parallel Jobs on Distributed Systems
Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems. The methodology has two primary features: communica...
Fabrizio Petrini, Wu-chun Feng
DLOG
2010
13 years 5 months ago
TBox Classification in Parallel: Design and First Evaluation
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
Mina Aslani, Volker Haarslev
ECAI
2010
Springer
13 years 9 months ago
Parallel TBox Classification in Description Logics - First Experimental Results
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
Mina Aslani, Volker Haarslev
LCPC
2007
Springer
14 years 2 months ago
Pillar: A Parallel Implementation Language
Abstract. As parallelism in microprocessors becomes mainstream, new programming languages and environments are emerging to meet the challenges of parallel programming. To support r...
Todd Anderson, Neal Glew, Peng Guo, Brian T. Lewis...
ICS
1995
Tsinghua U.
13 years 11 months ago
Run-Time Methods for Parallelizing Partially Parallel Loops
In this paper we give a new run–time technique for finding an optimal parallel execution schedule for a partially parallel loop, i.e., a loop whose parallelization requires syn...
Lawrence Rauchwerger, Nancy M. Amato, David A. Pad...