A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
A continuum of disk scheduling algorithms
1987
ACM Transactions on Computer Systems
Preserved Fulltext
A continuum of disk scheduling algorithms, V(R), having endpoints V(0) = SSTF and V(1) = SCAN, is defined. ...
The effective distance of a request in the opposite direction is its physical distance plus R X (total number of cylinders on the disk). ...
CONCLUSIONS We have presented V(R), a continuum of disk scheduling algorithms having endpoints V(0) = SSTF and V(1) = SCAN. ...
doi:10.1145/7351.8929
fatcat:zzf5wbd7t5h7him7ynrkry5guu
A New Approach to Disk Scheduling Using Fuzzy Logic
2014
Journal of Computer and Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Keeping in view a Fuzzy inference system using If-Then rules is designed to optimize the overall performance of disk drives. Finally we compared the FDS with the other scheduling algorithms. ...
Disk scheduling is one of the main responsibilities of Operating System. OS manages hard disk to provide best access time. ...
A disk scheduling algorithm is used to reduce total access time of disk requests. In this section we are briefly discussing different types of disk scheduling algorithms. ...
doi:10.4236/jcc.2014.21001
fatcat:mizebo6l2rdvrd4ib7nomoy3b4
Disk scheduling with shortest cumulative access time first algorithms
2017
Turkish Journal of Electrical Engineering and Computer Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A new class of scheduling algorithms is proposed for disk drive scheduling. ...
Simulation results are provided to validate the effectiveness of the proposed disk scheduler. ...
Conclusion A new class of disk-scheduling algorithms is presented based on the choice of a sequence of pending I/O requests at the scheduling instant with the shortest cumulative access time. ...
doi:10.3906/elk-1610-271
fatcat:y3s7buqf2jagxnjv34sjtabqpe
Scheduling algorithms for modern disk drives
1994
Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems - SIGMETRICS '94
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Disk subsystem performance can be dramatically improved by dynamically ordering, ...
VSCAN(R),
proposed
in [Geis87],
creates
a continuum
of algorithms
between
SSTF
and LOOK. ...
and
Validation
4.1
Disk simulator
We have developed
a detailed,
strongly
validated
disk
simulator
to compare
scheduling
algorithms. ...
doi:10.1145/183018.183045
dblp:conf/sigmetrics/WorthingtonGP94
fatcat:b575sd2fhvhypjkfqypzresiqi
Scheduling algorithms for modern disk drives
1994
Performance Evaluation Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Disk subsystem performance can be dramatically improved by dynamically ordering, ...
VSCAN(R),
proposed
in [Geis87],
creates
a continuum
of algorithms
between
SSTF
and LOOK. ...
and
Validation
4.1
Disk simulator
We have developed
a detailed,
strongly
validated
disk
simulator
to compare
scheduling
algorithms. ...
doi:10.1145/183019.183045
fatcat:f32tv7xhfjasrpkiouppzkk4dy
Large-scale compute-intensive analysis via a combined in-situ and co-scheduling workflow approach
2015
Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on - SC '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The analysis routines are implemented using the PISTON/VTK-m framework, allowing a single implementation of an algorithm that simultaneously targets a variety of GPU, multicore, and many-core architectures ...
We introduce an analysis framework developed for HACC, a cosmological N-body code, that uses both in-situ and co-scheduling approaches for handling petabyte-scale outputs. ...
The very high mass resolution of the Q Continuum simulation forced us to rethink this strategy and, in the meantime, store the full raw outputs on disk to enable a later off-line analysis. ...
doi:10.1145/2807591.2807663
dblp:conf/sc/SewellHFZPFPFLM15
fatcat:n2dmld724bcalmwiuf2neftisi
Solar Activity Observed with the New Nobeyama Radioheliograph
1993
International Astronomical Union Colloquium
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
It is a T-shaped array operating as a multiple spacing grating-type radio interferometer at 17 GHz and is dedicated to full disk solar observations. ...
In the three months of routine observations two X-class flares, several M-class flares and a number of small flares were observed. ...
Full-disk images are radio from Nobeyama and the visual continuum from YOHKOH. ...
doi:10.1017/s0252921100029316
fatcat:lroxmwilwbaulbtxqovkqccomm
A GPU-COMPUTING APPROACH TO SOLAR STOKES PROFILE INVERSION
2012
Astrophysical Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We show the advantages of pairing a population-parallel genetic algorithm with data-parallel GPU-computing techniques, and present an overview of the Stokes inversion problem, including a description of ...
Using a genetic algorithm (GA) engineered specifically for use with a GPU, we produce full-disc maps of the photospheric vector magnetic field from polarized spectral line observations recorded by the ...
Kindratenko of the National Center for Supercomputing Applications (NCSA) at the University of Illinois at Urbana-Champagne for kindly providing access to the Accelerator Cluster. ...
doi:10.1088/0004-637x/757/1/8
fatcat:s2ftijnhdjd7pdnrdetxaxeskq
Quality of Service Aware Orchestration for Cloud–Edge Continuum Applications
2022
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
scheduling algorithms. ...
It focuses on the application's quality of service by providing the scheduler with input that is commonly used by modern scheduling algorithms. ...
In order to enable the use of these algorithms in the Cloud-Edge continuum, the scheduler needs to be provided with network state metrics. ...
doi:10.3390/s22051755
pmid:35270901
pmcid:PMC8914660
fatcat:cmicnnizhndkflqwt7y6jger7u
A comparison of approaches in fitting continuum SEDs
2013
Research in Astronomy and Astrophysics
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2012 pre-print arXiv:1211.4309v1 fatcat:ro7diejvsfe5nec4a3rkv6h5eq
We present a detailed comparison of two approaches, the use of a pre-calculated database and simulated annealing (SA), for fitting the continuum spectral energy distribution (SED) of astrophysical objects ...
Our result shows directly the applicability of SA in the field of SED modeling, since the algorithm regularly finds better solutions to the optimization problem than a pre-calculated database. ...
of the algorithm. ...
doi:10.1088/1674-4527/13/4/005
fatcat:fkowlx5wozal3ced6radnbqp3u
BDPS: An Efficient Spark-Based Big Data Processing Scheme for Cloud Fog-IoT Orchestration
2021
Information
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
of algorithmic (i.e., depth-first search) efficiency, including the Bellman–Ford (BF) algorithm, Floyd–Warshall (FW) algorithm, Dijkstra algorithm (DA), and Apache Hadoop (AH) algorithm. ...
The Internet of Things (IoT) has seen a surge in mobile devices with the market and technical expansion. IoT networks provide end-to-end connectivity while keeping minimal latency. ...
Conflicts of Interest: The authors declare no conflict of interest. ...
doi:10.3390/info12120517
fatcat:khvzinc2u5cqtiwrrebmhxdfka
MEASURING SUPERMASSIVE BLACK HOLE SPINS IN AGN
2013
Acta Polytechnica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Herein, I discuss how we measure black hole spin in AGN, using recent results from a long Suzaku campaign on NGC 3783 to illustrate this process and its caveats. ...
Measuring the spins of supermassive black holes (SMBHs) in active galactic nuclei (AGN) can inform us about the relative role of gas accretion vs. mergers in recent epochs of the life of the host galaxy ...
The best-fit parameters of the BH/inner disk system included a spin of a ≥ +0.98, a disk inclination angle of i = 22 +3 −8 deg to the line of sight, a disk iron abundance of Fe/solar = 3.7 ± 0.9 and an ...
doi:10.14311/ap.2013.53.0652
fatcat:oueftomlvze6tmff6ddv36n5eu
Transforming policies into mechanisms with infokernel
2003
ACM SIGOPS Operating Systems Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Specifically, we show that the default file cache replacement algorithm, file layout policy, disk scheduling algorithm, and TCP congestion control algorithm can each be turned into base mechanisms. ...
An infokernel exposes key pieces of information about its algorithms and internal state; thus, its default policies become mechanisms, which can be controlled from user-level. ...
User-level Policies: The amount of code for our two scheduling policies is shown in Table 4 . infoIdleSched is a simple disk scheduling algorithm that allows a process to schedule requests only when a ...
doi:10.1145/1165389.945455
fatcat:vg4xeadu45g4polp2noncbm5oa
Transforming policies into mechanisms with infokernel
2003
Proceedings of the nineteenth ACM symposium on Operating systems principles - SOSP '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Specifically, we show that the default file cache replacement algorithm, file layout policy, disk scheduling algorithm, and TCP congestion control algorithm can each be turned into base mechanisms. ...
An infokernel exposes key pieces of information about its algorithms and internal state; thus, its default policies become mechanisms, which can be controlled from user-level. ...
User-level Policies: The amount of code for our two scheduling policies is shown in Table 4 . infoIdleSched is a simple disk scheduling algorithm that allows a process to schedule requests only when a ...
doi:10.1145/945453.945455
fatcat:xdtgiw7ylnhtlnecyezuy2q6by
Changing interaction of compiler and architecture
1997
Computer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Processors can now implement register renaming and dynamic instruction scheduling algorithms directly in the hardware-something that was once exclusively the compiler's job. ...
In this article, we describe an optimization continuum with compile time and post-runtime as endpoints and show how different classes of optimizations fall within it. ...
Most compiler scheduling algorithms assume that either all loads will hit or all loads will miss in the cache, although more recent techniques perform latency-sensitive load scheduling. 1 Nevertheless ...
doi:10.1109/2.642815
fatcat:eeeujapt6ja5lfjjzwkfgyfn5i
« Previous
Showing results 1 — 15 out of 4,039 results