Sciweavers

335 search results - page 58 / 67
» Analysis of application performance and its change via repre...
Sort
View
INFOCOM
2000
IEEE
13 years 12 months ago
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...
Go Hasegawa, Takahiro Matsuo, Masayuki Murata, Hid...
CONCUR
1999
Springer
13 years 11 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
ICCBR
1999
Springer
13 years 11 months ago
Case Representation, Acquisition, and Retrieval in SIROCCO
As part of our investigation of how abstract principles are operationalized to facilitate their application to specific fact situations, we have begun to develop and experiment wit...
Bruce M. McLaren, Kevin D. Ashley
ICS
1993
Tsinghua U.
13 years 11 months ago
The EM-4 Under Implicit Parallelism
: The EM-4 is a supercomputer that offers very fast inter processor communication and support for multi threading. In this paper we demonstrate that the EM-4, Together with an auto...
Lubomir Bic, Mayez A. Al-Mouhamed
ISCAPDCS
2007
13 years 9 months ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel