<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Quaestiones Informaticae Vol 2 No 3</title>
<link href="https://ir.unisa.ac.za/handle/10500/24003" rel="alternate"/>
<subtitle/>
<id>https://ir.unisa.ac.za/handle/10500/24003</id>
<updated>2026-05-06T12:40:48Z</updated>
<dc:date>2026-05-06T12:40:48Z</dc:date>
<entry>
<title>Modelling Blocking on Admission of Tasks to Computer Systems</title>
<link href="https://ir.unisa.ac.za/handle/10500/24057" rel="alternate"/>
<author>
<name>Wulf, S.</name>
</author>
<id>https://ir.unisa.ac.za/handle/10500/24057</id>
<updated>2018-05-24T01:01:22Z</updated>
<published>1983-01-01T00:00:00Z</published>
<summary type="text">Modelling Blocking on Admission of Tasks to Computer Systems
Wulf, S.
The need for modelling techniques to allow blocking of tasks prior to admission to the computer system in queueing&#13;
network models is described. A detailed algorithm which presents a technique to enforce blocking by priority of class&#13;
for an arbitrary number of blocking constraints is presented. The resultant solution is exact and produces an analysis&#13;
by class of admission queueing delays.
</summary>
<dc:date>1983-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Nebulas as Structural Data Models</title>
<link href="https://ir.unisa.ac.za/handle/10500/24056" rel="alternate"/>
<author>
<name>Van Rooyen, H.O.</name>
</author>
<author>
<name>Weiermans, D.J.</name>
</author>
<id>https://ir.unisa.ac.za/handle/10500/24056</id>
<updated>2018-05-24T01:01:21Z</updated>
<published>1983-01-01T00:00:00Z</published>
<summary type="text">Nebulas as Structural Data Models
Van Rooyen, H.O.; Weiermans, D.J.
Nebula modell_ing is_ a generalised structural modelling technique which applies to any finite set of objects (entities)&#13;
and n-ary relat1onsh1ps (n ~2). A nebula model can be presented in either diagrammatic or tabular form, and combines&#13;
the properties of graph (binary) data models with those of tabular (relational) data models. We give a brief introduction&#13;
to nebula data modelling by means of a simple illustration.
</summary>
<dc:date>1983-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>An Improved Implementation of Grimbleby's Algorithm</title>
<link href="https://ir.unisa.ac.za/handle/10500/24055" rel="alternate"/>
<author>
<name>Schach, Stephen R.</name>
</author>
<id>https://ir.unisa.ac.za/handle/10500/24055</id>
<updated>2018-05-24T01:01:22Z</updated>
<published>1983-01-01T00:00:00Z</published>
<summary type="text">An Improved Implementation of Grimbleby's Algorithm
Schach, Stephen R.
Details are given of an implementation of Grimbleby's algorithm for the common spanning tree problem with running&#13;
times up to 50% less than for the original implementation. An explanation is given as to why implementations with&#13;
even lower running times are unlikely.
</summary>
<dc:date>1983-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>An Analytical Model of a Mixed-Workload MVS Computer System</title>
<link href="https://ir.unisa.ac.za/handle/10500/24054" rel="alternate"/>
<author>
<name>Mann, R.J.</name>
</author>
<id>https://ir.unisa.ac.za/handle/10500/24054</id>
<updated>2018-05-24T01:01:22Z</updated>
<published>1983-01-01T00:00:00Z</published>
<summary type="text">An Analytical Model of a Mixed-Workload MVS Computer System
Mann, R.J.
A basic description of the facilities of the computer modelling package, AUTO-CONFIGURATER, is presented together&#13;
with detailed procedures to calculate the required input parameters from monitor statistics. Techniques to calibrate&#13;
the model are described together with an investigation into how the modelling package enables configuration and&#13;
tuning alternatives to be evaluated.
</summary>
<dc:date>1983-01-01T00:00:00Z</dc:date>
</entry>
</feed>
