Results 1  10
of
160,791
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 672 (33 self)
 Add to MetaCart
of the algorithm running in O(nm log(n²/m)) time on an nvertex, medge graph. This is as fast as any known method for any graph density and faster on graphs of moderate density. The algorithm also admits efticient distributed and parallel implementations. A parallel implementation running in O(n²log n) time using
Fusion, Propagation, and Structuring in Belief Networks
 ARTIFICIAL INTELLIGENCE
, 1986
"... Belief networks are directed acyclic graphs in which the nodes represent propositions (or variables), the arcs signify direct dependencies between the linked propositions, and the strengths of these dependencies are quantified by conditional probabilities. A network of this sort can be used to repre ..."
Abstract

Cited by 485 (8 self)
 Add to MetaCart
structured), then probabilities can be updated by local propagation in an isomorphic network of parallel and autonomous processors and that the impact of new information can be imparted to all propositions in time proportional to the longest path in the network. The second part of the paper deals with the problem of finding a
A distributed algorithm for minimumweight spanning trees
, 1983
"... A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange ..."
Abstract

Cited by 435 (3 self)
 Add to MetaCart
A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm
LogGP: Incorporating Long Messages into the LogP Model  One step closer towards a realistic model for parallel computation
, 1995
"... We present a new model of parallel computationthe LogGP modeland use it to analyze a number of algorithms, most notably, the single node scatter (onetoall personalized broadcast). The LogGP model is an extension of the LogP model for parallel computation [CKP + 93] which abstracts the comm ..."
Abstract

Cited by 287 (1 self)
 Add to MetaCart
the communication of fixedsized short messages through the use of four parameters: the communication latency (L), overhead (o), bandwidth (g), and the number of processors (P ). As evidenced by experimental data, the LogP model can accurately predict communication performance when only short messages are sent (as
Heuristic algorithms for scheduling independent tasks on nonidentical processors
 Journal of the ACM
, 1977
"... ABSTRACt. The finishing time properties of several heuristic algorithms for scheduhng n independent tasks on m nonidentical processors are studied In particular, for m = 2 an n log n timebounded algorithm is given which generates a schedule having a fimshmg Ume of at most (.,/5 + 1)/2 of the optima ..."
Abstract

Cited by 247 (0 self)
 Add to MetaCart
ABSTRACt. The finishing time properties of several heuristic algorithms for scheduhng n independent tasks on m nonidentical processors are studied In particular, for m = 2 an n log n timebounded algorithm is given which generates a schedule having a fimshmg Ume of at most (.,/5 + 1
Data parallel algorithms
 Communications of the ACM
, 1986
"... Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the control parallel style used in multiprocessing. The success of data parallel algorithmseven on problems that at first glance seem inherently serialsuggests that this style ..."
Abstract

Cited by 285 (1 self)
 Add to MetaCart
with tens of thousands or even millions of processors. The algorithms described all use O(N) processors to solve problems of size N, typically in O(log N) time. Some of the examples solve problems that at first sight seem inherently serial, such as parsing strings and finding the end of a linked list
The parallel evaluation of general arithmetic expressions
 Journal of the ACM
, 1974
"... ABSTRACT. It is shown that arithmetic expressions with n> 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can be evaluated in time 4 log2n + 10(n 1)/p using p> 1 processors which can independently perform arithmetic operati ..."
Abstract

Cited by 258 (1 self)
 Add to MetaCart
ABSTRACT. It is shown that arithmetic expressions with n> 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can be evaluated in time 4 log2n + 10(n 1)/p using p> 1 processors which can independently perform arithmetic
A Comparison of Dynamic Branch Predictors that use Two Levels of Branch History
 in Proceedings of the 20th Annual International Symposium on Computer Architecture
, 1993
"... Recent attention to speculative execution as a mechanism for increasing performance of single instruction streams has demanded substantially better branch prediction than what has been previously available. We [1, 2] and Pan, So, and Rahmeh [4] have both proposed variations of the same aggressive dy ..."
Abstract

Cited by 279 (9 self)
 Add to MetaCart
Recent attention to speculative execution as a mechanism for increasing performance of single instruction streams has demanded substantially better branch prediction than what has been previously available. We [1, 2] and Pan, So, and Rahmeh [4] have both proposed variations of the same aggressive dynamic branch predictor for handling those needs. We call the basic model TwoLevel Adaptive Branch Prediction; Pan, So, and Rahmeh call it Correlation Branch Prediction. In this paper, we adopt the terminology of [2] and show that there are really nine variations of the same basic model. We compare the nine variations with respect to the amount of history information kept. We study the effects of different branch history lengths and pattern history table configurations. Finally, we evaluate the cost effectiveness of the nine variations. 1 Introduction With the current movement toward deeper pipelines and wider issue rates, extremely high branch prediction accuracy becomes critical because a...
McRTSTM: a High Performance Software Transactional Memory System for a MultiCore Runtime
 In Proc. of the 11th ACM Symp. on Principles and Practice of Parallel Programming
, 2006
"... Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed this concurrency using locks (mutex based synchronization). Unfortunately, lock based synchronization often leads to deadl ..."
Abstract

Cited by 240 (14 self)
 Add to MetaCart
RTSTM exports interfaces that can be used from C/C++ programs directly or as a target for compilers translating higher level linguistic constructs. We present a detailed performance analysis of various STM design tradeoffs such as pessimistic versus optimistic concurrency, undo logging versus write buffering
Results 1  10
of
160,791