Sciweavers

103 search results - page 13 / 21
» Graph partitioning using single commodity flows
Sort
View
IPPS
2005
IEEE
15 years 6 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch
SIGMETRICS
1998
ACM
15 years 4 months ago
Scheduling Policies to Support Distributed 3D Multimedia Applications
We consider the problem of scheduling tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among no...
Thu D. Nguyen, John Zahorjan
92
Voted
ICDM
2007
IEEE
192views Data Mining» more  ICDM 2007»
15 years 6 months ago
Discovering Temporal Communities from Social Network Documents
Discovering communities from documents involved in social discourse is an important topic in social network analysis, enabling greater understanding of the relationships among act...
Ding Zhou, Isaac G. Councill, Hongyuan Zha, C. Lee...
HPDC
2007
IEEE
15 years 6 months ago
Feedback-directed thread scheduling with memory considerations
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...
Fengguang Song, Shirley Moore, Jack Dongarra
ICDAR
2011
IEEE
14 years 2 days ago
Graph Clustering-Based Ensemble Method for Handwritten Text Line Segmentation
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...
Vasant Manohar, Shiv Naga Prasad Vitaladevuni, Hua...