Results 1  10
of
398,129
Solving Large, Irregular Graph Problems using Adaptive Workstealing
"... Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support finegrained, irregular parallelism well. We present XWS, the X10 Work Stealing framework, an opensource runtime for the parallel programming language X10 and a ..."
Abstract
 Add to MetaCart
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support finegrained, irregular parallelism well. We present XWS, the X10 Work Stealing framework, an opensource runtime for the parallel programming language X10 and a
Using WorkStealing
"... In this chapter, we present a methodology for efficient load balancing of computational problems that can be easily decomposed into multiple tasks, but where it is hard to predict the computation cost of each task, and where new tasks are created dynamically during runtime. We present this methodolo ..."
Abstract
 Add to MetaCart
this methodology and its exploitation and feasibility in the context of graphics processors. Workstealing allows an idle core to acquire tasks from a core that is overloaded, causing the total work to be distributed evenly among cores, while minimizing the communication costs, as tasks are only redistributed when
WorkStealing Jobs
, 2004
"... This thesis addresses the problem of scheduling multiple, concurrent, adaptively parallel jobs on a multiprogrammed sharedmemory multiprocessor. Adaptively parallel jobs are jobs for which the number of processors that can be used without waste varies during execution. We focus on the specific case ..."
Abstract
 Add to MetaCart
case of parallel jobs that are scheduled using a randomized workstealing algorithm, as is used in the Cilk multithreaded language. We begin by developing a theoretical model for twolevel scheduling systems, or those in which the operating system allocates processors to jobs, and the jobs schedule
Executing task graphs using workstealing
 2010 IEEE International Symposium on Parallel Distributed Processing IPDPS
, 2010
"... Abstract—NABBIT is a workstealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Cilk++. We prove that NABBIT executes static task graphs in parallel in time which is asymptotically optimal for graphs who ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Abstract—NABBIT is a workstealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Cilk++. We prove that NABBIT executes static task graphs in parallel in time which is asymptotically optimal for graphs
Limits of WorkStealing Scheduling
"... Abstract. The number of applications with many parallel cooperating processes is steadily increasing, and developing efficient runtimes for their execution is an important task. Several frameworks have been developed, such as MapReduce and Dryad, but developing scheduling mechanisms that take into a ..."
Abstract
 Add to MetaCart
into account processing and communication requirements is hard. In this paper, we explore the limits of work stealing scheduler, which has empirically been shown to perform well, and evaluate loadbalancing based on graph partitioning as an orthogonal approach. All the algorithms are implemented in our Nornir
A fast and high quality multilevel scheme for partitioning irregular graphs
 SIAM JOURNAL ON SCIENTIFIC COMPUTING
, 1998
"... Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc. ..."
Abstract

Cited by 1173 (16 self)
 Add to MetaCart
Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc.
Configurable Strategies for Workstealing∗
, 2013
"... Workstealing systems are typically oblivious to the nature of the tasks they are scheduling. For instance, they do not know or take into account how long a task will take to execute or how many subtasks it will spawn. Moreover, the actual task execution order is typically determined by the underly ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Workstealing systems are typically oblivious to the nature of the tasks they are scheduling. For instance, they do not know or take into account how long a task will take to execute or how many subtasks it will spawn. Moreover, the actual task execution order is typically determined
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 734 (21 self)
 Add to MetaCart
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional
Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow
, 1999
"... In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating highfidelit ..."
Abstract

Cited by 553 (24 self)
 Add to MetaCart
In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating high
Interprocedural Slicing Using Dependence Graphs
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1990
"... ... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previou ..."
Abstract

Cited by 822 (85 self)
 Add to MetaCart
... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends
Results 1  10
of
398,129