Bernhard Fechner

Bernhard Fechner

Auto-generated profile, based on publicly available information

Bernhard Fechner

University of Augsburg

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 April 2015 in ACM Computing Surveys
Verified
Journal Article
Open access
Steffen WendzelSteffen Wendzel
Steffen Wendzel
SZSebastian Zander
Sebastian Zander
BFBernhard Fechner
Bernhard Fechner
CHChristian Herdin
Christian Herdin
Network covert channels are used to hide communication inside network protocols. Various techniques for covert channels have arisen in the past few decades. We surveyed and analyzed 109 techniques developed between 1987 and 2013 and show that these techniques can be reduced to only 11 different patterns. Moreover, the majority (69.7%) of techniques can be categorized into only four different patterns (i.e., most techniques we surveyed are similar). We represent the patterns in a hierarchical catalog using a pattern language. Our pattern catalog will serve as a base for future covert channel novelty evaluation. Furthermore, we apply the concept of pattern variations to network covert channels. With pattern variations, the context of a pattern can change. For example, a channel developed for IPv4 can automatically be adapted to other network protocols. We also propose the pattern-based covert channel optimizations pattern hopping and pattern combination. Finally, we lay the foundation for pattern-based countermeasures: whereas many current countermeasures were developed for specific channels, a pattern-oriented approach allows application of one countermeasure to multiple channels. Hence, future countermeasure development can focus on patterns, and the development of real-world protection against covert channels is greatly simplified.

1 November 2014 in Microprocessors and Microsystems
Verified
Journal Article
Closed access
RGRoberto Giorgi
Roberto Giorgi
RBRosa M. Badia
Rosa M. Badia
FBFrançois Bodin
François Bodin
ACAlbert Cohen
Albert Cohen
PEParaskevas Evripidou
Paraskevas Evripidou
MVMateo Valero
Mateo Valero

1 September 2013
Verified
Conference Paper
Closed access
MSMarco Solinas
Marco Solinas
RBRosa M. Badia
Rosa M. Badia
FBFrancois Bodin
Francois Bodin
ACAlbert Cohen
Albert Cohen
PEParaskevas Evripidou
Paraskevas Evripidou
RGRoberto Giorgi
Roberto Giorgi
Thanks to the improvements in semiconductor technologies, extreme-scale systems such as teradevices (i.e., composed by 1000 billion of transistors) will enable systems with 1000+ general purpose cores per chip, probably by 2020. Three major challenges have been identified: programmability, manageable architecture design, and reliability. TERAFLUX is a Future and Emerging Technology (FET) large-scale project funded by the European Union, which addresses such challenges at once by leveraging the dataflow principles. This paper describes the project and provides an overview of the research carried out by the TERAFLUX consortium.

29 May 2014 in International Journal of Parallel Programming
Verified
Journal Article
Closed access
PDF file
SWSebastian Weis
Sebastian Weis
AGArne Garbade
Arne Garbade
BFBernhard Fechner
Bernhard Fechner
AMAvi Mendelson
Avi Mendelson
RGRoberto Giorgi
Roberto Giorgi
TUTheo Ungerer
Theo Ungerer

1 October 2011
Verified
Conference Paper
Closed access
SWSebastian Weis
Sebastian Weis
AGArne Garbade
Arne Garbade
JWJulian Wolf
Julian Wolf
BFBernhard Fechner
Bernhard Fechner
AMAvi Mendelson
Avi Mendelson
TUTheo Ungerer
Theo Ungerer
Future computing systems (Teradevices) will probably contain more than 1000 cores on a single die. To exploit this parallelism, threaded dataflow execution models are promising, since they provide side-effect free execution and reduced synchronization overhead. But the terascale transistor integration of such chips make them orders of magnitude more vulnerable to voltage fluctuation, radiation, and process variations. This means reliability techniques have to be an essential part of such future systems, too.In this paper, we conceptualize a fault tolerant architecture for a scalable threadeddataflow system. We provide methods to detect permanent, intermittent, and transientfaults during the execution. Furthermore, we propose a recovery technique for dataflow threads.

1 April 2008 in 2008 IEEE International Symposium on Parallel and Distributed Processing
Verified
Conference Paper
Closed access
BFBernhard Fechner
Bernhard Fechner
UHUdo Honig
Udo Honig
JKJorg Keller
Jorg Keller
WSWolfram Schiffmann
Wolfram Schiffmann
While fault-tolerance is desirable for grid applications because of the distributed and dynamic nature of grid resources, it has seldom been considered in static scheduling. We present a fault-tolerant static scheduler for grid applications that uses task duplication and combines the advantages of static scheduling, namely no overhead for the fault-free case, and of dynamic scheduling, namely low overhead in case of a fault. We also give preliminary experimental results on our scheme.