Sciweavers

1182 search results - page 62 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
PLDI
1997
ACM
15 years 11 months ago
Dynamic Feedback: An Effective Technique for Adaptive Computing
This paper presents dynamic feedback, a technique that enables computations to adapt dynamically to different execution environments. A compiler that uses dynamic feedback produce...
Pedro C. Diniz, Martin C. Rinard
185
Voted
ITCC
2005
IEEE
16 years 7 days ago
Performance Analysis of Mobile Backbone Topology Synthesis Algorithm for Wireless Ad Hoc Networks
In this paper, we present a scalable fully distributed version of a Mobile Backbone Network Topology Synthesis Algorithm (MBN-TSA) for constructing and maintaining a dynamic backb...
Laura Huei-jiun Ju, Izhak Rubin
ISCAPDCS
2003
15 years 8 months ago
N-Tuple Compression: A Novel Method for Compression of Branch Instruction Traces
Branch predictors and processor front-ends have been the focus of a number of computer architecture studies. Typically they are evaluated separately from other components using tr...
Aleksandar Milenkovic, Milena Milenkovic, Jeffrey ...
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
15 years 6 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
SC
2009
ACM
16 years 1 months ago
Scalable work stealing
Irregular and dynamic parallel applications pose significant challenges to achieving scalable performance on large-scale multicore clusters. These applications often require ongo...
James Dinan, D. Brian Larkins, P. Sadayappan, Srir...