Sciweavers

1636 search results - page 282 / 328
» Managing Distributed Applications Using Gush
Sort
View
ICDCS
2010
IEEE
13 years 11 months ago
Sifting through Network Data to Cull Activity Patterns with HEAPs
—Today’s large campus and enterprise networks are characterized by their complexity, i.e. containing thousands of hosts, and diversity, i.e. with various applications and usage...
Esam Sharafuddin, Yu Jin, Nan Jiang, Zhi-Li Zhang
DAWAK
2009
Springer
13 years 11 months ago
TidFP: Mining Frequent Patterns in Different Databases with Transaction ID
Since transaction identifiers (ids) are unique and would not usually be frequent, mining frequent patterns with transaction ids, showing records they occurred in, provides an effic...
C. I. Ezeife, Dan Zhang
PPOPP
1995
ACM
13 years 11 months ago
Optimistic Active Messages: A Mechanism for Scheduling Communication with Computation
Low-overhead message passing is critical to the performance of many applications. Active Messages[27] reduce the software overhead for message handling: messages are run as handle...
Deborah A. Wallach, Wilson C. Hsieh, Kirk L. Johns...
DEBS
2008
ACM
13 years 9 months ago
Relative temporal constraints in the Rete algorithm for complex event detection
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
Karen Walzer, Tino Breddin, Matthias Groch
GRID
2008
Springer
13 years 8 months ago
On correlated availability in Internet-distributed systems
As computer networks rapidly increase in size and speed, Internet-distributed systems such as P2P, volunteer computing, and Grid systems are increasingly common. A precise and acc...
Derrick Kondo, Artur Andrzejak, David P. Anderson