Sciweavers

86 search results - page 7 / 18
» Distributed dynamic partial order reduction
Sort
View
146
Voted
WCFLP
2005
ACM
15 years 5 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
LCN
1999
IEEE
15 years 4 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen
AMAST
2006
Springer
15 years 1 months ago
DO-Casl: An Observer-Based Casl Extension for Dynamic Specifications
We present DO-Casl, a new member of the CASL family of specification languages. It is an extension of Casl-Ltl and it supports a methodology for conveniently writing loose specific...
Matteo Dell'Amico, Maura Cerioli
96
Voted
EDBT
2006
ACM
191views Database» more  EDBT 2006»
15 years 11 months ago
Parallelizing Skyline Queries for Scalable Distribution
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are rest...
Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Div...
IPPS
2007
IEEE
15 years 6 months ago
Formal Analysis for Debugging and Performance Optimization of MPI
High-end computing is universally recognized to be a strategic tool for leadership in science and technology. A significant portion of high-end computing is conducted on clusters...
Ganesh Gopalakrishnan, Robert M. Kirby