3 research outputs found

    Discrete Simulation in Java: Process Scheduling

    Get PDF
    Tato práce se zabývá implementací plánování procesů pro diskrétní simulaci v Javě. Rozebírá dva přístupy: implementaci simulačních procesů pomocí vláken a implementaci simulačních procesů bez vláken. Hlavním problémem při použití vláken bylo zabezpečit jejich kooperativní přepínání. Procesy implementované bez vláken jsou rozdělené na atomické části a k přerušení může dojít pouze mezi těmito částmi. Výsledky testování poukazují na to, že implementace pomocí vláken je podstatně pomalejší a paměťově náročnější.This thesis deals with process scheduling implementation for discrete simulation in Java. Two approaches are considered: process implementation using threads and process implementation without threads. Main problem of using threads was to ensure cooperative switching. Processes implemented without threads are divided into atomic parts and suspend can be performed only between these parts. Test results show that implementation using threads is considerably slower and consumes more memory.

    Realisation of Stepping for Real-World ASP Languages

    No full text
    perpétuo e sem limites geográficos, de arquivar e publicar esta dissertação através de exemplares impressos reproduzidos em papel ou de forma digital, ou por qualquer outro meio conhecido ou que venha a ser inventado, e de a divulgar através de repositórios científicos e de admitir a sua cópia e distribuição com objectivos educacionais ou de investigação, não comerciais, desde que seja dado crédito ao autor e editor. ivFor MelisviAcknowledgements I would like to thank my supervisor for having a lot of patience with me, the team at TUW for having this wonderful idea, Melis and Ingo for support, and my family, this would not be possible without them. Stepping is folklore in debugging of procedural programming languages that allows developers to focus their attention to each statement of their program one after the other. Recent results in the field of answer-set programming (ASP) debugging brought forth a formalism for stepping through answer-set programs. The main idea is to monotonically build up an interpretation by, at each step, adding literals derived by a rule that is active under the partial interpretation obtained in the previous step. As the stepping framewor
    corecore