Sciweavers

5005 search results - page 116 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
122
Voted
IPPS
2003
IEEE
15 years 6 months ago
UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
Yang Yang, Henri Casanova
105
Voted
ICCCN
2008
IEEE
15 years 7 months ago
Policy Distribution Methods for Function Parallel Firewalls
—Parallel firewalls offer a scalable low latency design for inspecting packets at high speeds. Typically consisting of an array of m firewalls, these systems filter arriving p...
Michael R. Horvath, Errin W. Fulp, Patrick Wheeler
PPOPP
1993
ACM
15 years 4 months ago
Experiences Using the ParaScope Editor: an Interactive Parallel Programming Tool
The ParaScope Editor is an interactive parallel programming tool that assists knowledgeable users in developing scienti c Fortran programs. It displays the results of sophisticate...
Mary W. Hall, Timothy J. Harvey, Ken Kennedy, Nath...
113
Voted
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
15 years 6 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
ICPADS
2007
IEEE
15 years 7 months ago
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
Hoda Akbari, Zeinab Iranmanesh, Mohammad Ghodsi