1528 search results - page 115 / 306 » On Signatures for Communication Graphs |
273
click to vote
ISCA
2002
IEEE
15 years 5 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
155
click to vote
CDC
2008
IEEE
16 years 19 days ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
171
click to vote
CHARME
2001
Springer
15 years 9 months ago
2001
Springer
The framework of this paper is the formal specification and proof of applications distributed on symmetric interconnection networks, e.g. the torus or the hypercube. The algorithms...
139
click to vote
INFOCOM
2006
IEEE
16 years 5 days ago
2006
IEEE
— Fast spreading worms are a reality, as amply demonstrated by worms such as Slammer, which reached its peak propagation in a matter of minutes. With these kinds of fast spreadin...
183
Voted
ACSAC
2009
IEEE
15 years 10 months ago
2009
IEEE
Audit logs, providing information about the current and past states of systems, are one of the most important parts of modern computer systems. Providing security for audit logs on...