Offline and online disk scheduling problems

Download

index.pdf

Date

2006

Author

Aşan, N. Evren

Metadata

Show full item record

Item Usage Stats

91
views

25
downloads

This thesis considers the disk scheduling problem. The problem is investigated in two types of settings: offline and online. We first adopt the traveling salesman problem with time windows in the scheduling literature for solving the offline problem. Then we develop a decision epoch scheme in which offline problems are iteratively used in solving the online problem. We perform an experimental study for our approach and two well-known disk scheduling algorithms, and compare them according to several performance criteria.

Subject Keywords

Electronic Computers., Computer Science.

URI

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

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A Static analysis approach for service oriented software engineering (SOSE) designs Çermikli, Can; Doğru, Ali Hikmet; Department of Computer Engineering (2010) In this thesis, a static analysis approach is introduced in order to develop correct business processes according to the Web Service Business Process Execution Language (WS-BPEL) specification. The modeling of the business processes are conducted with Business Process Execution Language (BPEL) which is a popular orchestrator of Service Oriented Architectures (SOA) based system through the description of workflow. This approach is also integrated to the Service Oriented Software Engineering (SOSE) design tec...
A simulation tool for mc6811 Sarıkan (Tuncer), Nazlı; Güran, Hasan; Department of Electrical and Electronics Engineering (2004) The aim of this thesis study is to develop a simulator for an 8-bit microcontroller and the written document of this thesis study analyses the process of devoloping a software for simulating an 8 bit microcontroller, MC68HC11. In this simulator study a file processing including the parsing of the assembler code and the compilation of the parsed instructions is studied. Also all the instruction execution process containing the cycle and instruction execution and the interrupt routine execution is observed th...
Ontology based semantic retrieval of video contents using metadata Akpınar, Samet; Alpaslan, Ferda Nur; Department of Computer Engineering (2007) The aim of this thesis is the development of an infrastructure which is used for semantic retrieval of multimedia contents. Motivated by the needs of semantic search and retrieval of multimedia contents, operating directly on the MPEG-7 based annotations can be thought as a reasonable way for meeting these needs as MPEG-7 is a common standard providing a wide multimedia content description schema. However, it is clear that the MPEG-7 formalism is deficient about the semantics and reasoning support. From thi...
A dependable computing application Güngör, Uğur; Güran, Hasan Cengiz; Department of Electrical and Electronics Engineering (2005) This thesis focuses on fault tolerance which is kind of dependable computing implementation. It deals with the advantages of fault tolerance techniques on Single Event Upsets (SEU) occurred in a Field Programmable Gate Array (FPGA). Two fault tolerant methods are applied to floating point multiplier. Most common SEU mitigation method is Triple Modular Redundancy (TMR). So, two fault tolerance methods, which use TMR, are tested. There are three printed circuit boards (PCBs) and one user interface software in...
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

N. E. Aşan, “Offline and online disk scheduling problems,” M.S. - Master of Science, Middle East Technical University, 2006.