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

Jork Löser

dblp:05/4085 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 1 first-authorSystems, architecture and hardware · 1Security and privacy · 1Applied, interdisciplinary, general and emerging computing · 1

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.

Network and information security
1 paper
Hardware security and side channels · 100%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Integrated circuit design · 48% Embedded and real-time systems · 46% Performance modeling and evaluation · 6%

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

TopicWeightPapersLastEvidence papers
Hardware security and side channels
trusted execution environments
0.212016
fTPM: A Software-Only Implementation of a TPM Chip · USENIX Security Symposium 2016
Hardware security and side channels › trusted execution environments
trusted platform module
0.212016
fTPM: A Software-Only Implementation of a TPM Chip · USENIX Security Symposium 2016
Embedded and real-time systems › real-time scheduling
admission control
0.012001
Quality-Assuring Scheduling-Using Stochastic Behavior to Improve Resource Utilization · RTSS 2001
Embedded and real-time systems
real-time scheduling
0.012001
Quality-Assuring Scheduling-Using Stochastic Behavior to Improve Resource Utilization · RTSS 2001
Embedded and real-time systems
execution time distribution
0.012001
Quality-Assuring Scheduling-Using Stochastic Behavior to Improve Resource Utilization · RTSS 2001
Performance modeling and evaluation
workload characterization
0.012001
Quality-Assuring Scheduling-Using Stochastic Behavior to Improve Resource Utilization · RTSS 2001

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

stochastic modeling · 0.0resource reservation · 0.0
YearPublicationVenuePosition
2016 fTPM: A Software-Only Implementation of a TPM Chip
Himanshu Raj, Stefan Saroiu, Alec Wolman, Ronald Aigner, Jeremiah Cox, Paul England, Chris Fenner, Kinshuman Kinshumann, Jork Löser, Dennis Mattoon, Magnus Nyström, Rob Spiger, Stefan Thom, David Wooten
USENIX Security Symposium9
2004 Low-Latency Hard Real-Time Communication over Switched Ethernet
abstract
A number of algorithms have been presented for handling software decoding of MPEG-2 streams based on buffering or rate adjustment focusing on providing good average quality. The potentially arising drops in quality are tolerated, e.g., in transmissions over the Internet; they cannot be accepted in high quality consumer products: these mandate real-time methods. When resources, such as processing power or network bandwidth, are limited and not all frames can be handled, best effort decoders incur unnecessary quality decrease while wasting resources. In this paper, we present a method for quality aware frame selection for MPEG decoding under limited resources, based on realistic timing constraints for the decoding of MPEG streams. Given that not all frames can be processed, it selects those which provide the best picture quality while matching the available resources, starting only such decoding, which is guaranteed to be completed. We formulate the method as real-time scheduling problem and present its application in an example scheduling algorithm. Results from study based on realistic MPEG-2 video underline the effectiveness of our approach.
Jork Löser, Hermann Härtig
ECRTS1
2001 dibSIM: a parallel functional logic simulator allowing dynamic load balancing
abstract
To meet the demanding time-re-market requirements in VLSI/ULSI design, the acceleration of verification processes is inevitable. The parallelization of cycle-based simulation at register-transfer- and gate level is one facet in a series of efforts targeted at this objective. We introduce dlbSIM, a parallel compiled code functional logic simulator that has been developed to run on loosely-coupled systems. It has the ability to balance the application-specific load of cooperating simulator instances in dependence of the overall load situation on involved processor nodes. Thereby, the load of a simulator instance is expressed in terms of a set of circuit model parts which are to be simulated by the corresponding instance. The centralized load management runs simultaneously with a parallel simulation. Both processes interact after a controllable number of simulated clock-cycles to transmit load information and realize load modifications. dlbSIM is successfully used to simulate IBM S/390 processor models.
Klaus Hering, Jork Löser, Jens Markwardt
DATE2
2001 A Streaming Interface for Real-Time Interprocess Communication
abstract
Timely transfer of long, continuous data streams and handling data omission are stringent requirements of multimedia applications. To cope with these requirements, we extend well known mechanisms for inter-address-space data transmission, such as zero-copy and fast IPC, by the notion of time. Therefore, we add a time track to data streams and add mechanisms to limit the validity of data. For cases of overload we add notification and revocation techniques.
Jork Löser, Hermann Härtig, Lars Reuther
HotOS1
2001 Quality-Assuring Scheduling-Using Stochastic Behavior to Improve Resource Utilization
abstract
We present a unified model for admission and scheduling, applicable for various active resources such as CPU or disk to assure a requested quality in situations of temporary overload. The model allows us to predict and control the behavior of applications based on given quality requirements. It uses the variations in the execution time, i.e., the time any active resource is needed We split resource requirements into a mandatory part which must be available and an optional part which should be available as often as possible but at least with a certain percentage. In combination with a given distribution for the execution time we can move away from worst-case reservations and drastically reduce the amount of reserved resources for applications which can tolerate occasional deadline misses. This increases the number of admittable applications. For example, with negligible loss of quality our system can admit more than two times the disk bandwidth than a system based on the worst-case. Finally, we validated the predictions of our model by measurements using a prototype real-time system and observed a high accuracy between predicted and measured values.
Claude-Joachim Hamann, Lars Reuther, Jork Wolter, Hermann Härtig, Jork Löser, Sebastian Schönberg
RTSS5