Sciweavers

36 search results - page 1 / 8
» Dynamizing static algorithms, with applications to dynamic t...
Sort
View
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
13 years 6 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
ACTAC
2002
102views more  ACTAC 2002»
13 years 4 months ago
Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithm
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...
Csaba Faragó, Tamás Gergely
SIGSOFT
2005
ACM
14 years 5 months ago
Matching execution histories of program versions
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
Xiangyu Zhang, Rajiv Gupta
ECR
2002
165views more  ECR 2002»
13 years 4 months ago
A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups
Many new multimedia applications involve dynamic multiple participants, have stringent endto-end delay requirement and consume large amount of network resources. In this paper, we...
Zhengying Wang, Bingxin Shi, Ling Zou
MICRO
2010
IEEE
149views Hardware» more  MICRO 2010»
13 years 2 months ago
Improving SIMT Efficiency of Global Rendering Algorithms with Architectural Support for Dynamic Micro-Kernels
Wide Single Instruction, Multiple Thread (SIMT) architectures often require a static allocation of thread groups that are executed in lockstep throughout the entire application ker...
Michael Steffen, Joseph Zambreno