Learn More
ÐNew heuristic algorithms are proposed for the Graph Partitioning problem. A greedy construction scheme with an appropriate tie-breaking rule (MIN-MAX-GREEDY) produces initial assignments in a very fast time. For some classes of graphs, independent repetitions of MIN-MAX-GREEDY are sufficient to reproduce solutions found by more complex techniques. When the(More)
ÐHard-real-time systems require predictable performance despite the occurrence of failures. In this paper, fault tolerance is implemented by using a novel duplication technique where each task scheduled on a processor has either an active backup copy or a passive backup copy scheduled on a different processor. An active copy is always executed, while a(More)
—Broadcast is an efficient and scalable way of transmitting data to an unlimited number of clients that are listening to a channel. Cyclically broadcasting data over the channel is a basic scheduling technique, which is known as flat scheduling. When multiple channels are available, a data allocation technique is needed to assign data to channels.(More)
Given the success of recent greedy schemes with tie-breaking rules proposed by the authors, this paper extends the investigation by considering diierent greedy approaches for the graph bi-partitioning problem. In particular , a new method is proposed (Diff-Greedy) that ameliorates in a signiicant way the performance of the previously proposed(More)
As the use of mobile communications systems grows, the need arises for new and more efficient channel allocation techniques. The total number of available channels on a real-world network is in fact a scarce resource, and many assignment heuristics suffer from a clear lack of flexibility (this is the case of Fixed Channel Allocation), or from high(More)