Sciweavers

716 search results - page 36 / 144
» time 1997
Sort
View
JSSPP
1997
Springer
15 years 4 months ago
Modeling of Workload in MPPs
In this paper we have characterized the inter-arrival time and service time distributions for jobs at a large MPP supercomputing center. Our findings show that the distributions ...
Joefon Jann, Pratap Pattnaik, Hubertus Franke, Fan...
COMPGEOM
1997
ACM
15 years 4 months ago
Approximate Nearest Neighbor Queries Revisited
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
Timothy M. Chan
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
15 years 1 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
ATMN
1996
15 years 1 months ago
Study of multiplexing for group-based quality of service delivery
In this work, the problem of scheduling packets with a group as opposed to an individual deadline is considered. Packets of the same group are supposed to belong in the same appli...
Xin Wang, Ioannis Stavrakakis
SRDS
1997
IEEE
15 years 4 months ago
Availability Analysis of Transaction Processing Systems based on User-Perceived Performance
Transaction processing systems are judged by users to be correctly functioning not only if their transactions are executed correctly, but also if most of them are completed within...
Varsha Mainkar