47 search results - page 3 / 10 » Constructing and exploiting linear schedules with prescribed... |
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we present a new technique which exploits timing-correlation between tasks for scheduling analysis in multiprocessor and distributed systems with tree-shaped task-de...
SPAA
1999
ACM
13 years 11 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
CGO
2009
IEEE
14 years 2 months ago
2009
IEEE
—The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. This model allows programmers to sp...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
The Web Service Resource Framework (WSRF) was announced in January 2004 as a new way for manipulating "stateful resources" to perform grid computing tasks using Web Serv...