Sciweavers

2254 search results - page 380 / 451
» Computing the minimal covering set
Sort
View
SIGCOMM
2004
ACM
14 years 4 months ago
Optimizing cost and performance for multihoming
Multihoming is often used by large enterprises and stub ISPs to connect to the Internet. In this paper, we design a series of novel smart routing algorithms to optimize cost and p...
David Kiyoshi Goldenberg, Lili Qiu, Haiyong Xie 00...
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
14 years 4 months ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka
EUROPAR
2004
Springer
14 years 4 months ago
Scheduling Tasks Sharing Files from Distributed Repositories
Abstract. This paper is devoted to scheduling a large collection of independent tasks onto a distributed heterogeneous platform, which is composed of a set of servers. Each server ...
Arnaud Giersch, Yves Robert, Frédéri...
DSD
2003
IEEE
138views Hardware» more  DSD 2003»
14 years 4 months ago
A Two-step Genetic Algorithm for Mapping Task Graphs to a Network on Chip Architecture
Network on Chip (NoC) is a new paradigm for designing core based System on Chip which supports high degree of reusability and is scalable. In this paper we describe an efficient t...
Tang Lei, Shashi Kumar
ISSRE
2003
IEEE
14 years 4 months ago
Exploiting Symmetries to Test Programs
Symmetries often appear as properties of many artifical settings. In Program Testing, they can be viewed as properties of programs and can be given by the tester to check the cor...
Arnaud Gotlieb