5448 search results - page 112 / 1090 » Breakpoints and Time in Distributed Computations |
131
click to vote
PPAM
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
113
Voted
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
131
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents general techniques for formally modeling, simulating, and model checking real-time resource-sharing protocols in Real-Time Maude. The “scheduling subset” o...
149
click to vote
ISORC
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper describes experiences in using an O.O. language (Java) in designing, prototyping and evaluating a CPU manager. QoS Animator facilitates the execution of object oriented...
111
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
In this paper, we describe an adaptive QOS mapping scheme where the QOS parameters of applications are mapped into resource requirements dynamically, and the resources for the appl...