IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
We describe a prototype Web service for model reduction of very large-scale linear systems. Specifically, a userfriendly interface is designed so that model reduction can be easi...
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
High-end supercomputers are increasingly built out of commodity components, and lack tight integration between the processor and network. This often results in inefficiencies in ...
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
In this paper, we describe a compilation system that automates much of the process of performance tuning that is currently done manually by application programmers interested in h...
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiproce...
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
As computing systems of all types grow in power and complexity, it is common to want to simultaneously execute processes with different timeliness constraints. Many systems use CP...