Dynamic scheduling in the presence of faults: Specification and verification

Jankowski, Tomasz; Joseph, Mathai

doi:10.1007/3-540-61648-9_46

Cited by 10 publications

(7 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It also shows a class of bisimulations which are fault-monotonic and within CCS support reasoning and design of reactive systems under weak assumptions about faults. The timed extension of this work is in [9]. Some directions for future work include proving completeness of the preservation laws, extending the framework to specify and reason about graceful degradation and relating the notions of realisability [1] and faultmonotonicity.…”

Section: Discussionmentioning

confidence: 99%

On bisimulation, fault-monotonicity and provable fault-tolerance

Janowski

1997

Algebraic Methodology and Software Technology

Self Cite

View full text Add to dashboard Cite

We introduce a necessary test for the claims about provable fault-tolerance: having proved to tolerate several faults, we must tolerate (provably) any combination of them. One notable failure to pass this test is bisimulation. The paper presents a class of bisimulations which are fault-monotonic and within CCS support compositional design of component specifications by stepwise refinement, each step increasing or at least preserving the current level of fault-tolerance.

show abstract

Section: Discussionmentioning

confidence: 99%

On bisimulation, fault-monotonicity and provable fault-tolerance

Janowski

1997

Algebraic Methodology and Software Technology

Self Cite

View full text Add to dashboard Cite

show abstract

“…Each character represents the unique identification number of a task and the −1 character is used to delimit the processor queues for each different processor. This representation has a length of N + M − 1, where N is the number of tasks in the batch and M is the total number of processors, according with [12]. Zomaya proposed in [13] a two dimensional representation.…”

Section: Proposed Solution Based On Evolutionary Computingmentioning

confidence: 99%

Reputation-guided evolutionary scheduling algorithm for independent tasks in inter-clouds environments

Pop¹,

Dobre²,

Cristea³

et al. 2015

IJWGS

View full text Add to dashboard Cite

Self-Adaptation provides software with flexibility in terms of the different behaviours (configurations) it incorporates and the autonomous or semi-autonomous ability to switch between these behaviours to maintain and maximize its quality in response to changes. For Clouds it becomes important to accommodate uncertainty about clients and the evolving nature of their business and IT worlds: their profiles and skills, competitive technology and business, the devices and network accesses they use, etc. To empower Clouds with ability to capture and respond to the quality feedback, provided by users at runtime, we propose a reputation guided genetic scheduling algorithm for independent tasks. Current resource management services consider evolutionary strategies in order to improve the performance on resource allocation procedures or tasks scheduling algorithms -but they fail to consider the user as part of the scheduling process. Evolutionary computing offers different methods to solve NP-hard problems, finding a near-optimal solution. In this paper we extended our previous work with new optimization heuristics for the problem of scheduling. We show how reputation is considered as an optimization metric analyze how our considered metrics can be considered as upper bounds for others in the optimization algorithm. By experimental comparison, we show that our optimization techniques can be hybridized for optimized results.

show abstract

“…General models for the verification of fault-tolerant algorithms are also present in the literature, for example [7]. The main difference with our approach is that our models (similar to the software) are on a higher-abstraction level than those works; there is more intelligence built-in the Erlang component programming model than in general model, and it is interesting to see, that using such a model actually makes it easier to verify the correctness of the solution.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Verification of Language Based Fault-Tolerance

Earle

Fredlund

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper we target the verification of fault tolerant aspects of distributed applications written in the Erlang programming language. Erlang programmers mostly work with ready-made language components. Our approach to verification of fault tolerance is to verify systems built using a central component of most Erlang software, a generic server component with fault tolerance handling.To verify such Erlang programs we automatically translate them into processes of the µCRL process algebra, generate their state spaces, and use a model checker to determine whether they satisfy correctness properties specified in the µ-calculus.The key observation of this paper is that, due to the usage of these higher-level design patterns, the state space generated from a Erlang program, even with failures occurring, is relatively small, and can be generated automatically.

show abstract

Dynamic scheduling in the presence of faults: Specification and verification

Cited by 10 publications

References 12 publications

On bisimulation, fault-monotonicity and provable fault-tolerance

On bisimulation, fault-monotonicity and provable fault-tolerance

Reputation-guided evolutionary scheduling algorithm for independent tasks in inter-clouds environments

Verification of Language Based Fault-Tolerance

Contact Info

Product

Resources

About