Sciweavers

4539 search results - page 411 / 908
» Approaches to Compute Workflow Complexity
Sort
View
P2P
2005
IEEE
104views Communications» more  P2P 2005»
16 years 11 days ago
Range Queries in Trie-Structured Overlays
Among the open problems in P2P systems, support for non-trivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of...
Anwitaman Datta, Manfred Hauswirth, Renault John, ...
EDBT
2009
ACM
135views Database» more  EDBT 2009»
15 years 11 months ago
Provenance for nested subqueries
Data provenance is essential in applications such as scientific computing, curated databases, and data warehouses. Several systems have been developed that provide provenance fun...
Boris Glavic, Gustavo Alonso
DASFAA
2010
IEEE
129views Database» more  DASFAA 2010»
15 years 11 months ago
Efficient Approximate Visibility Query in Large Dynamic Environments
Abstract. Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in ...
Leyla Kazemi, Farnoush Banaei Kashani, Cyrus Shaha...
172
Voted
FASE
1998
Springer
15 years 11 months ago
Specifying and Analyzing Dynamic Software Architectures
A critical issue for complex component-based systems design is the modeling and analysis of architecture. One of the complicating factors in developing architectural models is acc...
Robert Allen, Rémi Douence, David Garlan
ASPLOS
1992
ACM
15 years 11 months ago
Application-Controlled Physical Memory using External Page-Cache Management
Next generation computer systems will have gigabytes of physical memory and processors in the 200 MIPS range or higher. While this trend suggests that memory management for most p...
Kieran Harty, David R. Cheriton