Patim: proximity aware time management

Download

index.pdf

Date

2008

Author

Okutanoğlu, Aydın

Metadata

Show full item record

Item Usage Stats

32
views

38
downloads

Logical time management is used to synchronize the executions of distributed simulation elements. In existing time management systems, such as High Level Architecture (HLA), logical times of the simulation elements are synchronized. However, in some cases synchronization can unnecessarily decrease the performance of the system. In the proposed HLA based time management mechanism, federates are clustered into logically related groups. The relevance of federates is taken to be a function of proximity which is defined as the distance between them in the virtual space. Thus, each federate cluster is composed of relatively close federates according to calculated distances. When federate clusters are sufficiently far from each other, there is no need to synchronize them, as they do not relate each other. So in PATiM mechanism, inter-cluster logical times are not synchronized when clusters are sufficiently distant. However, if the distant federate clusters get close to each other, they will need to resynchronize their logical times. This temporal partitioning is aimed at reducing network traffic and time management calculations and also increasing the concurrency between federates. The results obtained based on case applications have verified that clustering improves local performance as soon as federates become unrelated.

Subject Keywords

Computer software., Computer science.

URI

http://etd.lib.metu.edu.tr/upload/12609997/index.pdf
https://hdl.handle.net/11511/17967

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Scheduling approaches for parameter sweep applications in a heterogeneous distributed environment Karaduman, Gülşah; Şener, Cevat; Alpdemir, Mahmut Nedim; Department of Computer Engineering (2010) In this thesis, the focus is on the development of scheduling algorithms for Sim-PETEK which is a framework for parallel and distributed execution of simulations. Since it is especially designed for running parameter sweep applications in a heterogeneous distributed computational environment, multi-round and adaptive scheduling approaches are followed. Five different scheduling algorithms are designed and evaluated for scheduling purposes of Sim-PETEK. Development of these algorithms are arranged in a way t...
Dspptool: a tool to support distributed software project planning Yağız, Sevil Yılmaz; Demirörs, Onur; Department of Information Systems (2004) This thesis focuses on the development of a distributed software project planning tool that enables more than one participant to prepare the different parts of the project scope, schedule and task assignment by allowing to utilize the predefined organizational level processes. For this purpose, we discuss the need for a distributed software project planning tool, identify tool requirements and compare available tools with respect to the requirements. In addition, we evaluate the tool based on two criteria: ...
Software project scheduling, software project performance measurement and control Kanık, Yusuf; Koçyiğit, Altan; Department of Information Systems (2005) This thesis is about software project scheduling and use of earned value method on software projects. As a result of the study, a solution for software project scheduling problems is proposed. A mathematical formulation, developed using integer programming method, is at the heart of the solution. Objective of the formulation is to minimize the development costs consisting of direct labor cost, indirect costs and probable penalty costs. The formulation takes the capability and compatibility variances among r...
Learning customized and optimized lists of rules with mathematical programming Rudin, Cynthia; Ertekin Bolelli, Şeyda (Springer Science and Business Media LLC, 2018-12-01) We introduce a mathematical programming approach to building rule lists, which are a type of interpretable, nonlinear, and logical machine learning classifier involving IF-THEN rules. Unlike traditional decision tree algorithms like CART and C5.0, this method does not use greedy splitting and pruning. Instead, it aims to fully optimize a combination of accuracy and sparsity, obeying user-defined constraints. This method is useful for producing non-black-box predictive models, and has the benefit of a clear ...
Anomaly detection from personal usage patterns in web applications Vural, Gürkan; Yöndem (Turhan), Meltem; Department of Computer Engineering (2006) The anomaly detection task is to recognize the presence of an unusual (and potentially hazardous) state within the behaviors or activities of a computer user, system, or network with respect to some model of normal behavior which may be either hard-coded or learned from observation. An anomaly detection agent faces many learning problems including learning from streams of temporal data, learning from instances of a single class, and adaptation to a dynamically changing concept. The domain is complicated by ...

Citation Formats

A. Okutanoğlu, “Patim: proximity aware time management,” Ph.D. - Doctoral Program, Middle East Technical University, 2008.