239 research outputs found

    Distributed Data-Gathering and -Processing in Smart Cities: An Information-Centric Approach

    Get PDF
    The technological advancements along with the proliferation of smart and connected devices (things) motivated the exploration of the creation of smart cities aimed at improving the quality of life, economic growth, and efficient resource utilization. Some recent initiatives defined a smart city network as the interconnection of the existing independent and heterogeneous networks and the infrastructure. However, considering the heterogeneity of the devices, communication technologies, network protocols, and platforms the interoperability of these networks is a challenge requiring more attention. In this paper, we propose the design of a novel Information-Centric Smart City architecture (iSmart), focusing on the demand of the future applications, such as efficient machineto-machine communication, low latency computation offloading, large data communication requirements, and advanced security. In designing iSmart, we use the Named-Data Networking (NDN) architecture as the underlying communication substrate to promote semantics-based communication and achieve seamless compute/data sharing

    Priority based round robin (PBRR) CPU scheduling algorithm

    Get PDF
    This paper introduce a new approach for scheduling algorithms which aim to improve real time operating system CPU performance. This new approach of CPU Scheduling algorithm is based on the combination of round-robin (RR) and Priority based (PB) scheduling algorithms. This solution maintains the advantage of simple round robin scheduling algorithm, which is reducing starvation and integrates the advantage of priority scheduling. The proposed algorithm implements the concept of time quantum and assigning as well priority index to the processes. Existing round robin CPU scheduling algorithm cannot be dedicated to real time operating system due to their large waiting time, large response time, large turnaround time and less throughput. This new algorithm improves all the drawbacks of round robin CPU scheduling algorithm. In addition, this paper presents analysis comparing proposed algorithm with existing round robin scheduling algorithm focusing on average waiting time and average turnaround time

    Improved time quantum length estimation for round robin scheduling algorithm using neural network

    Get PDF
    In most cases, the quantum time length is taken to be fix in all applications that use Round Robin (RR) scheduling algorithm. Many attempts aim to determination of the optimal length of the quantum that results in a small average turnaround time, but the unknown nature of the tasks in the ready queue make the problem more complicated: Considering a large quantum length makes the RR algorithm behave like a First Come First Served (FIFO) scheduling algorithm, and a small quantum length cause high number of contexts switching. In this paper we propose a RR scheduling algorithm based on Neural Network Models for predicting the optimal quantum length which lead to a minimum average turnaround time. The quantum length depends on tasks burst times available in the ready queue. Rather than conventional traditional methods using fixed quantum length, this one giving better results by minimizing the average turnaround time for almost any set of jobs in the ready queue

    貯水池流域における土壌侵食の持続可能な制御のための最適管理施業の選択法 : 環境と経済性の効果に立脚した水保全手法の評価

    Get PDF
    この博士論文は内容の要約のみの公開(または一部非公開)になっています筑波大学 (University of Tsukuba)201
    corecore