Sciweavers

Share
IPPS
2003
IEEE
9 years 5 months ago
Allocating Servers in Infostations for On-Demand Communications
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...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
IPPS
2003
IEEE
9 years 5 months ago
Channel Assignment on Strongly-Simplicial Graphs
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...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
IPPS
2003
IEEE
9 years 5 months ago
Remote Model Reduction of Very Large Linear Systems
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...
Peter Benner, Rafael Mayo, Enrique S. Quintana-Ort...
IPPS
2003
IEEE
9 years 5 months ago
An Evaluation of Current High-Performance Networks
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 ...
Christian Bell, Dan Bonachea, Yannick Cote, Jason ...
IPPS
2003
IEEE
9 years 5 months ago
ECO: An Empirical-Based Compilation and Optimization System
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...
Nastaran Baradaran, Jacqueline Chame, Chun Chen, P...
IPPS
2003
IEEE
9 years 5 months ago
Dual Priority Algorithm to Schedule Real-Time Tasks in a Shared Memory Multiprocessor
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...
Josep M. Banús, Alex Arenas, Jesús L...
IPPS
2003
IEEE
9 years 5 months ago
Better Real-Time Response for Time-Share Scheduling
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...
Scott A. Banachowski, Scott A. Brandt
books