3934 search results - page 271 / 787 » Approximate Schedulability Analysis |
193
click to vote
FAST
2007
15 years 8 months ago
2007
Fully distributed storage systems have gained popularity in the past few years because of their ability to use cheap commodity hardware and their high scalability. While there are...
126
click to vote
COR
2010
15 years 6 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
153
click to vote
IEICET
2006
15 years 6 months ago
2006
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...
155
click to vote
DKE
2007
15 years 6 months ago
2007
The use of rules in a distributed environment creates new challenges for the development of active rule execution models. In particular, since a single event can trigger multiple ...
138
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Most alias analyses produce approximate results in the presence of array slices. This may lead to ine cient code which is of concern, especially, in languages like Fortran90. In t...