1749 search results - page 322 / 350 » Conditional colorings of graphs |
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
A distributed system is commonly modelled by a graph where nodes represent processors and there is an edge between two processors if and only if they can communicate directly. In ...
80
Voted
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
124
click to vote
PRDC
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
ASPDAC
2006
ACM
15 years 5 months ago
2006
ACM
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
ATVA
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...