A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In this setting, some obscure phenomena are known to exist, related to the fact that schedulers may yield too pessimistic verification results, since current nondeterminism can surprisingly be resolved ... The latter uses an encoding into the model of stochastic timed automata under arbitrary schedulers, for which model checking tool support has recently become available. ... are not supposed to be prophets. ...doi:10.1007/978-3-319-27810-0_11 fatcat:rjczvpwxqbehhpssdgdakpohnu
Further simulations show that these results outperform the MaxProp and PRoPHET routing protocols that have their own scheduling and dropping mechanisms. ... Therefore, efficient scheduling and dropping policies are necessary to improve the overall network performance. ... Hence, there is no guarantee that the TTL of these messages will expire soon or not. Random scheduling policy sends messages in a random order. ...doi:10.1109/icppw.2009.33 dblp:conf/icppw/SoaresRFN09 fatcat:d457w6xy7bhsnln3gf4pg2mvf4
The execution instance for scheduling becomes executor, which executes an entire application once it is scheduled. Usually it is not short lived. Its resource demands are significantly time-varying. ... With this knowledge, Prophet schedules executors to minimize resource fragmentation and over-allocation. ... Section III describes design of the Prophet scheduling scheme. Section IV describes the implementation and evaluation of Prophet. ...doi:10.12783/dtssehs/asshm2016/8355 fatcat:sxd7htsllzalvlmxopfpvze7hy
Two scheduling mechanisms are proposed to extend the traditional PROPHET protocol and improve performance in both storage and transmission in DTN. ... The results demonstrate that the proposed Scheduling-PROPHET can achieve better performances in several key aspects compared with the existing protocols. ... Conflicts of Interest: The authors declare no conflict of interest. ...doi:10.3390/s19020243 fatcat:mbslrkrbknfyvfygydpelk5cdy
are hard to model in previous approaches. ... Parallel Prophet models many realistic features of parallel programs: unbalanced workload, multiple critical sections, nested and recursive parallelism, and specific thread schedulings and paradigms, which ... Kismet is different from Parallel Prophet in that no annotation is needed. ...doi:10.1109/ipdps.2012.128 dblp:conf/ipps/KimKKB12 fatcat:hcolajzgqfayzduw4nnb74fkt4
2009 International Workshop on Satellite and Space Communications
In this study, we evaluate some of the most prominent routing protocols for Delay-Tolerant Networks, Epidemic, PRoPHET and Contact Graph Routing, in space environment. ... In this context, all data packets are handled equally and no special treatment can be applied to urgent data. ... PRoPHET is a completely autonomous routing protocol since no management is required; available links between nodes are dynamically discovered and previous knowledge is used for planning future transmissions ...doi:10.1109/iwssc.2009.5286392 fatcat:ylqzfz42vfaadj263vramfnjry
These factors are very important in the hospital staff scheduling problem. ... Concerning this, this paper establishes an optimization system combining a two-layer mixed-integer linear programming and an extended prophet model for the hospital personnel scheduling. ... In manual scheduling, the work shift schedules of medical personnel are typically decided by the hospital managers. ...doi:10.5281/zenodo.5105961 fatcat:e4bqm7qhurcinomz45qesx76hm
Lecture Notes in Computer Science
Measures of interest are defined over schedulers that resolve the nondeterminism. ... In this paper we investigate the power of various theoretically and practically motivated classes of schedulers, considering the classic complete-information view and a restriction to non-prophetic schedulers ... On the other hand, when restricting schedulers to see the expiration order only, history-dependent and memoryless schedulers are no longer equivalent: Proposition 5. S hist ,v,o S ml ,v,o . Proof. ...doi:10.1007/978-3-319-89366-2_21 fatcat:n5vypaav6fcmvp4lldb7zxdnqe
Measures of interest are defined over schedulers that resolve the nondeterminism. ... In this paper we investigate the power of various theoretically and practically motivated classes of schedulers, considering the classic complete-information view and a restriction to non-prophetic schedulers ... simple schedulers in planning. ...arXiv:1710.05763v1 fatcat:rcy7ywo6nbh3te3d6sbd32blr4
There can be no doubt that the weight of the argument is overwhelmingly in favor of a revision of Schedule K; but it is hardly necessary to weaken it by concessions which the facts do not seem to demand ... No king who has ever ruled could boast of such a lineage. There is no parallel anywhere to such a ...
In some original PRoPHET and original PRoPHETv2 testing, they are superior to other routing protocols. ... This happens because messages delivery to other relay nodes are assumed to encounter the destination (having a larger probability of encountering destination) while the other relay nodes are moving away ... The modified PRoPHET and the modified PRoPHETv2 are more suitable for use in environments that use scheduled trains that move in one direction and once a day as node relays than the original PRoPHET and ...doi:10.22266/ijies2019.0630.10 fatcat:e3wxqexctbe3ld5pfmzcraaqai
This proposed buffer management policy is evaluated with two popular DTN routing protocols Spray-and-Wait and Prophet. ... The two major issues in DTN are routing and buffer management. ... Result Analysis In figure 2 various protocols like SNW, ESNW, PROPHET, EPROPHET are compared by varying number of nodes. ...doi:10.35940/ijrte.d9145.118419 fatcat:w2lfnnciwjfbjdkbehlq6k25qq
This is contrary to community mobility model as shown for PROPHET algorithm, in which Most Forwarded First (MOFO) scheme performs better. ... In present scenario the innovation of mobile phones that are embedded with different types of onboard sensors, has brought on a new interest of using them as the main part of the sensor network, for a ... In OSN proper scheduling is defined by routing combined with proper buffer management policy. Moreover routing decisions are node based, so selection of proper Buffer management is also significant. ...doi:10.5120/21816-5144 fatcat:y2uqvkh3k5fefi7y54eewtnldy
Anglican Theological Review
Precisely where we are to pinpoint the Zwickau Prophets in all this ebb and flow of the prophetic impulse no- body can tell. ... His age of the Spirit was scheduled to begin in 1260. ...
In this paper the architecture of delay tolerant network is being discussed and PROPHET protocol is implemented. ... PROPHET routing protocol works on the principle of history of encounters and transitivity. It is called Probabilistic routing protocol since it uses a parameter 'Delivery of Predictability'. ... Opportunistic contacts: They are not scheduled, but are encountered unexpectedly and this takes place frequently due to node mobility. ...doi:10.9790/0661-0910107 fatcat:ouu3p3jp45hcrcbvpcmvnbmhh4
« Previous Showing results 1 — 15 out of 15,663 results