Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kassian Plankensteiner

dblp:71/2540 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 3 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 87% High-performance computing · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems
fault tolerance
0.112012
Meeting Soft Deadlines in Scientific Workflows Using Resubmission Impact · IEEE Trans. Parallel Distributed Syst. 2012
Distributed systems › workflow management
workflow execution
0.112012
Meeting Soft Deadlines in Scientific Workflows Using Resubmission Impact · IEEE Trans. Parallel Distributed Syst. 2012
High-performance computing
scientific workflow
0.012012
Meeting Soft Deadlines in Scientific Workflows Using Resubmission Impact · IEEE Trans. Parallel Distributed Syst. 2012

Methods — techniques the papers use, named apart from their topics

simulation · 0.1heuristic · 0.1
YearPublicationVenuePosition
2013 Fine-Grain Interoperability of Scientific Workflows in Distributed Computing Infrastructures
Kassian Plankensteiner, Radu Prodan, Matthias Janetschek, Thomas Fahringer, Johan Montagnat, David Rogers, Ian Harvey, Ian J. Taylor, Ákos Balaskó, Péter Kacsuk
J. Grid Comput.1
2012 Meeting Soft Deadlines in Scientific Workflows Using Resubmission Impact
abstract
We propose a new heuristic called Resubmission Impact to support fault tolerant execution of scientific workflows in heterogeneous parallel and distributed computing environments. In contrast to related approaches, our method can be effectively used on new or unfamiliar environments, even in the absence of historical executions or failure trace models. On top of this method, we propose a dynamic enactment and rescheduling heuristic able to execute workflows with a high degree of fault tolerance, while taking into account soft deadlines. Simulated experiments of three real-world workflows in the Austrian Grid demonstrate that our method significantly reduces the resource waste compared to conservative task replication and resubmission techniques, while having a comparable makespan and only a slight decrease in the success probability. On the other hand, the dynamic enactment method manages to successfully meet soft deadlines in faulty environments in the absence of historical failure trace information or models.
Kassian Plankensteiner, Radu Prodan
IEEE Trans. Parallel Distributed Syst.1
2010 Scheduling Scientific Workflows to Meet Soft Deadlines in the Absence of Failure Models
Kassian Plankensteiner, Radu Prodan, Thomas Fahringer
Euro-Par (1)1
2009 A New Fault Tolerance Heuristic for Scientific Workflows in Highly Distributed Environments Based on Resubmission Impact
abstract
Even though highly distributed environments such as Clouds and Grids are increasingly used for e-science high performance applications, they still cannot deliver the robustness and reliability needed for widespread acceptance as ubiquitous scientific tools. To overcome this problem, existing systems resort to fault tolerance mechanisms such as task replication and task resubmission. In this paper we propose a new heuristic called resubmission impact to enhance the fault tolerance support for scientific workflows in highly distributed systems. In contrast to related approaches, our method can be used effectively on systems even in the absence of historic failure trace data. Simulated experiments of three real scientific workflows in the Austrian Grid environment show that our algorithm drastically reduces the resource waste compared to conservative task replication and resubmission techniques, while having a comparable execution performance and only a slight decrease in the success probability.
Kassian Plankensteiner, Radu Prodan, Thomas Fahringer
eScience1