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.

Manfred Ruschitzka

dblp:77/4963 · DBLP profile ↗
← Back
12ranked-venue papers
7as first author
0since 2021 · last 1997
—ORCID · none

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

Systems, architecture and hardware · 8 · 4 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorSecurity and privacy · 1Human-computer interaction and ubiquitous computing · 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.

Network and information security
1 paper
Network security · 100%
Computer architecture, parallel and distributed computing, and storage systems
4 papers
Performance modeling and evaluation · 61% Distributed systems · 30% Storage systems · 9%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%
Databases, data mining, and information retrieval
3 papers
Data integration and cleaning · 51% Indexing and storage engines · 27% Database system architecture and tuning · 15%

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

TopicWeightPapersLastEvidence papers
Network security › intrusion detection and prevention › intrusion detection › intrusion detection system
distributed intrusion detection
0.011997
Execution Monitoring of Security-Critical Programs in Distributed Systems: A Specification-Based Approach · S&P 1997
Network security › intrusion detection and prevention
intrusion detection
0.011997
Execution Monitoring of Security-Critical Programs in Distributed Systems: A Specification-Based Approach · S&P 1997
Network security › intrusion detection and prevention › intrusion detection › anomaly detection
specification-based intrusion detection
0.011997
Execution Monitoring of Security-Critical Programs in Distributed Systems: A Specification-Based Approach · S&P 1997
Operating systems › resource management
memory management
0.011993
Managing Locality Sets: The Model and Fixed-Size Buffers · IEEE Trans. Computers 1993
Operating systems › resource management › memory management
page replacement
0.011993
Managing Locality Sets: The Model and Fixed-Size Buffers · IEEE Trans. Computers 1993
Indexing and storage engines
buffer management
0.011993
Managing Locality Sets: The Model and Fixed-Size Buffers · IEEE Trans. Computers 1993
Distributed systems › fault tolerance › checkpointing
checkpointing strategies
0.011984
Performance Analysis of Checkpointing Strategies · ACM Trans. Comput. Syst. 1984
Distributed systems › fault tolerance
rollback recovery
0.011984
Performance Analysis of Checkpointing Strategies · ACM Trans. Comput. Syst. 1984
Distributed systems › fault tolerance
checkpointing
0.011983
Performance analysis of checkpointing strategies · SIGMETRICS 1983
Storage systems
storage reliability
0.011983
Performance analysis of checkpointing strategies · SIGMETRICS 1983
Performance modeling and evaluation › queueing models › processor sharing
processor sharing queues
0.011982
The Performance of Job Classes with Distinct Policy Functions · J. ACM 1982
Performance modeling and evaluation
queueing models
0.011982
The Performance of Job Classes with Distinct Policy Functions · J. ACM 1982
Performance modeling and evaluation
scheduling analysis
0.011982
The Performance of Job Classes with Distinct Policy Functions · J. ACM 1982
Database system architecture and tuning
relational database system
0.011989
Heterogeneous Data Translations Based on Environment Grammars · IEEE Trans. Software Eng. 1989
Transaction processing and concurrency control › recovery
rollback and recovery
0.011983
Performance analysis of checkpointing strategies · SIGMETRICS 1983

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

locality-set model · 0.0formal specification · 0.0audit trail analysis · 0.0two-level grammar · 0.0performance analysis · 0.0error recovery modeling · 0.0attribute grammars · 0.0weibull distribution · 0.0failure distribution modeling · 0.0
YearPublicationVenuePosition
1997 Execution Monitoring of Security-Critical Programs in Distributed Systems: A Specification-Based Approach
abstract
We describe a specification-based approach to detect exploitations of vulnerabilities in security-critical programs. The approach utilizes security specifications that describe the intended behavior of programs and scans audit trails for operations that are in violation of the specifications. We developed a formal framework for specifying the security-relevant behavior of programs, on which we based the design and implementation of a real-time intrusion detection system for a distributed system. Also, we wrote security specifications for 15 Unix setuid root programs. Our system detects attacks caused by monitored programs, including security violations caused by improper synchronization in distributed programs. Our approach encompasses attacks that exploit previously unknown vulnerabilities in security-critical programs.
Calvin Ko, Manfred Ruschitzka, Karl N. Levitt
S&P2
1996 Optimal Management of Dynamic Buffer Caches
Andrew Choi, Manfred Ruschitzka
Perform. Evaluation2
1993 Managing Locality Sets: The Model and Fixed-Size Buffers
abstract
A memory-management model based on describing reference behavior in terms of locality-set sequences is proposed. Specialized for fixed-size buffers, this model is used to define the PSETMIN and SETMIN strategies which are proven to minimize the number of page faults in the presence and absence of prepaging, respectively. In contrast to MIN, they are also realizable for certain computations. The methodology for obtaining the locality-set sequence of a computation in advance is illustrated for relational database management systems with multiattribute-index catalogs, and the concomitant performance gains are discussed. In general, for applications that maintain their own organized collections of data, optimal locality-set management of individual computations provides an alternative to the widely used general-purpose strategies based on heuristics.>
Andrew Choi, Manfred Ruschitzka
IEEE Trans. Computers2
1990 Preface
Manfred Ruschitzka
Future Gener. Comput. Syst.1
1990 Two-level grammars for data conversions
Manfred Ruschitzka
Future Gener. Comput. Syst.1
1989 Heterogeneous Data Translations Based on Environment Grammars
abstract
The interactive exchange and translation of data between heterogeneuus computer systems depend not only on hardware and op ersting-system characteristics, But also on the proprietary format im- posed by the software systems maintaining it. For functionally com- parable software systems, we present a syntax-driven translation methodology based on environment grammars. Environment gram- mars are related to two-level grammars and attribute grammars, and they lend themselves to the spedflcatbn of parameterized language classes such as those formed by data in different proprietary formats. Under certain constraints they can also be parsed efiiently. We dis- cuss these constraints, demonstrate the use of the methodology for re- lational data, and present the design of a data translator for hetero- geneous relational database management systems. A prototype of this translator has been implemented and used to exchange relations be- tween remote INGRES, Framis, and Sibyl systems.
Manfred Ruschitzka, John L. Clevenger
IEEE Trans. Software Eng.1
1984 Performance Analysis of Checkpointing Strategies
abstract
A widely used error recovery technique in database systems is the rollback and recovery technique.Former models of rollback and recovery assumed Poisson failures and fixed (or exponential) checkpointing intervals.Extending these models, we consider general failure distributions.We also allow checkpointing intervals to depend on the reprocessing time and the failure distribution.Furthermore, failures may occur during checkpointing and error recovery.After deriving a general expression for system availability, we find that system availability resulting from the well-known equidistant checkpointing strategy depends only on the mean of the failure distribution.We then introduce a failure-dependent reprocessing-independent checkpointing strategy called equicost strategy.For Weibull failure distributions, which are good approximations of actual failure distributions of computer systems, we show that the equicost strategy achieves higher system availabilty than the equidistant strategy, which is known to be optimal under Poisson failures.
Asser N. Tantawi, Manfred Ruschitzka
ACM Trans. Comput. Syst.2
1983 Performance analysis of checkpointing strategies
abstract
A widely used error recovery technique in database systems is the rollback and recovery technique. This technique saves periodically the state of the system and records all activities on a reliable log tape. The operation of saving the system state is called checkpointing. The elapsed time between two consecutive checkpointing operations is called checkpointing interval. When the system fails, the recovery process uses the log tape and the state saved at the most recent checkpoint to bring the system to the correct state that preceded the failure. This process is called error recovery and consists of loading the most recent state and then reprocessing all the activities, stored on the log tape, that took place since the most recent checkpoint and prior to failure.
Asser N. Tantawi, Manfred Ruschitzka
SIGMETRICS2
1982 The Performance of Job Classes with Distinct Policy Functions
abstract
Policy function schedulers provide a flexible framework for specifying the response behavior of a system.The latter is often expressed m terms of a response function, the equihbrmm residence time of a job conditioned on its service requirement Jobs of different classes typically require different responses and thus different pohcy functmns.The relation between a set of policy functions (one per class) and the resulting set of response funcUons is derived for processor-sharing M/G/I systems and a large variety of policy function shapes.Given a set of destrable response functions, this relation may be used to solve the performance synthesis problem.Two types of class notions, one with and one without preemptmn based on externally assigned pnormes, are considered.Plots of correspondmg sets of policy and response funcUons are displayed for specific examples, and the differences caused by the two class types are discussed.
Manfred Ruschitzka
J. ACM1
1981 Policy function scheduling
Manfred Ruschitzka
Perform. Evaluation1
1979 A Load-sensitive Scheduler for Interacitve Systems
Manfred Ruschitzka
Performance1
1977 An operating systems implementation project for an undergraduate course
abstract
While the adoption of an implementation project for an operating systems course is certainly beneficial, non-trivial projects are inherently demanding in terms of student efforts and computer costs. This paper reports on a project which has been designed to keep the effort for an extensive simulation of a contemporary system within acceptable limits. The project involves both a hardware simulator and an operating system, and a considerable reduction of the overall effort could be achieved by enhancing the hardware with operating systems support features. The design criteria as well as the characteristics of the resulting hardware configuration and operating system are presented, and the value of the project as a teaching tool is discussed
Manfred Ruschitzka
SIGCSE-11