{"id":"3dfb9da6-ed23-4cd2-91bc-28856dc91c33","arxiv_id":"1908.01167","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":3.0,"correctness_risk":"high","formal_verification":"none","parameter_count":3,"one_line_summary":"A new LOOK-style disk scheduling algorithm with per-track sector and platter ordering plus a bad-sector handling table is claimed to cut disk access time by about 7.5 percent over earlier variants.","lead":"The paper proposes MODSBSM, a disk scheduling algorithm that orders requests by track, then sector, then platter, and adds a bad-sector list. Its claimed advantage rests on hand-picked test cases and a simplified cost model, not on real disk measurements.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The central quantitative claim is unsupported: the 33.53% and 7.51% gains are computed only under an ad hoc 8-sector/track cost model, with no real-disk or trace validation. The bad-sector 'resolution' also contradicts the paper's own definition of a bad sector as unreadable and non-writable.","rationale":"The reader's REJECT verdict is appropriate and should remain unchanged. The paper's quantitative headline depends entirely on a cost model defined by the authors in Section 4.1, with no connection to measured disk timing or standard workload traces. Because all algorithms are evaluated under the same invented units, the comparison may be internally consistent but externally meaningless; the 33.53% and 7.51% figures are not evidence of real-world improvement. The bad-sector mechanism is not merely unvalidated; it is definitionally impossible under the paper's own statement that a bad sector is unreadable and non-writable. Flipping a 'preferred bit' cannot make a physical defect readable, and no sector remapping is provided. The paper also lacks code, statistical analysis, and validation on real hardware. These are load-bearing flaws in the central claim, and no independent support mitigates them.","tokens_in":12693,"tokens_out":5797,"duration_ms":61386,"concrete_test":"Implement MODSBSM and the six traditional plus five derived baselines in a disk simulator with a real timing model (e.g., DiskSim configured for a 7200 RPM drive with a nonlinear seek curve and realistic sectors-per-track), then replay the paper's six 20-request cases and a set of random 20-request traces; if MODSBSM does not consistently beat MRSA/ODSA on total access time, the claimed 7.51% improvement is an artifact of the toy cost model.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim that MODSBSM 'performs better than all traditional and latest modified disk scheduling algorithms' rests on Table 3, whose totals are sums of six hand-constructed 20-request cases. Under the Section 4.1 cost model, rotational latency is the sector-number difference on an 8-sector track (Steps 36-39, 45-48), transfer time is |platter difference| + 1 (Steps 40, 49, 87, 96), and seek time is just track distance. None of these unit costs is tied to a real drive: real seek time is nonlinear with acceleration and settling, rotational latency is not simply sector difference, head-switch and settle times are nonzero, and modern disks use zoning and command queuing. The reported 33.53% and 7.51% reductions are arithmetic ratios of these invented units; they have no external validity. Additionally, the bad-sector procedure is internally inconsistent: a bad sector is defined as 'unreadable and non-writable' (Steps 23 and 70), yet BSM() resolves it by flipping a 'preferred bit' and then performing the memory operation (Steps 4-8). No amount of bit inversion can recover data from physically unreadable media, and the algorithm never remaps to spare sectors. Thus both the performance and bad-sector parts of the central claim are unsupported.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript proposes MODSBSM (Modern Optimized Disk Scheduling with Bad-Sector Management), a LOOK-style scheduler that orders requests by track, then sector, then platter, and includes a 'bad sector list' with a prescribed-bit recovery mechanism. The authors evaluate MODSBSM against six traditional algorithms and five recent LOOK-style algorithms on six hand-constructed 20-request cases covering single- and multi-platter disks with ascending, descending, and random track orders. They report a 33.53% reduction in total disk access time relative to traditional algorithms and a 7.51% reduction relative to the referred algorithms (Section 4.8, Table 3), and claim the algorithm detects and resolves bad sectors while reducing power consumption and heat. The paper's central assertions are that MODSBSM performs better than all compared algorithms under the stated performance measure and that its bad-sector management is functional.","tokens_in":12975,"tokens_out":4480,"duration_ms":39683,"significance":"If the performance claims were supported by realistic evaluation, MODSBSM would be a useful contribution as a LOOK-style scheduler that explicitly accounts for platter geometry and sector ordering. The paper is also commendable for presenting a complete pseudocode and a defined cost model that allows reproduction of the reported tables. However, the evaluation is entirely based on a self-defined cost model with no real disk measurements or trace replay, and the bad-sector mechanism is internally inconsistent with the paper's own definition of a bad sector. As a result, the central claims are not established. The work may serve as a thought experiment, but it is not yet a validated disk scheduling algorithm.","major_comments":[{"comment":"The evaluation rests on a cost model in which rotational latency is the sector-number difference on an 8-sector track (Steps 36-39, 45-48), transfer time is the absolute platter-number difference plus a unit transfer time (Steps 40, 49, 87, 96), and seek time is simply the track difference. These unit costs are not tied to any real disk timing; real drives have nonlinear seek curves, nonzero head-switch and settle times, zone-based recording, and command queuing. Because MODSBSM is constructed to minimize exactly these quantities by sorting sectors and platters, its advantage under this model follows by construction. The 33.53% and 7.51% improvements in Section 4.8 are arithmetic ratios of these invented units and have no demonstrated external validity. To make the claim load-bearing, the authors would need to validate the cost model against real disk timings or a calibrated simulator and confirm the ranking on realistic trace workloads.","section":"Section 4.1 and Steps 36-49, 87-96"},{"comment":"The algorithm defines a bad sector as 'unreadable and non-writable' (Steps 23 and 70), yet BSM() resolves it by flipping a 'preferred bit' and then performing the memory operation (Steps 4-8). No inversion of a bit can recover data from a physically unreadable medium, and the algorithm never remaps the sector to a spare area, which is how real drives handle bad sectors. The energy and heat savings formulas in Section 4.8 ('e*n-2' and 'h*n-2') are asserted without derivation or measurement, and the notation is undefined. These issues invalidate the claim in Section 5 that the algorithm can detect and resolve bad sectors.","section":"Section 3.1 Steps 22-31 and 69-78, BSM() Steps 4-8, Section 5"},{"comment":"The comparative analysis uses only six hand-constructed 20-request cases with no sensitivity analysis, varying request counts, or random sampling. The totals in Table 3 are sums over these six cases; for example the MODSBSM total disk access time is 1886 versus 1984 for SMCC, a roughly 5% difference that could easily reverse under a different but realistic unit-cost weighting. Without statistical analysis or workload diversity, the conclusion in Section 4.8 that the algorithm 'performs better than all traditional and latest modified disk scheduling algorithms' is an overgeneralization.","section":"Sections 4.2-4.7 and Table 3"}],"minor_comments":[{"comment":"The variable TSKT is initialized in Step 2, but the algorithm later updates 'SKT' in Steps 15, 52, 62, and 100; this appears to be an inconsistency and should be fixed by using TSKT throughout.","section":"Section 3.1, Steps 2, 15, 52, 62, 100"},{"comment":"The caption for the case-5 figure reads 'Figure 2: Working of all Disk-Scheduling algorithms for Case-5'; this should likely be Figure 16.","section":"Section 4.6"},{"comment":"Section 4.7 contains a typo: 'Figure 20represents' should be 'Figure 20 represents'.","section":"Section 4.7"},{"comment":"In Section 3.2, 'tack' appears instead of 'track' in the phrase 'with in each tack-sector combination'.","section":"Section 3.2"},{"comment":"The abstract states 'researchers try to optimize the CPU Scheduling algorithms' but the paper addresses disk scheduling; the opening sentences should be clarified to avoid confusion.","section":"Abstract"}],"recommendation":"reject","confidential_remarks":"I agree with the reader's assessment. The central performance claim is unsupported by any external validation, and the bad-sector mechanism is internally inconsistent with the paper's own definition. The evaluation methodology would need to be rebuilt from scratch with realistic disk timings and trace workloads, and the bad-sector handling would need to be reconciled with physical disk behavior. This is not a local-revision situation; the manuscript does not currently meet the standards of a serious journal."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Honest take: this is a minor extension of LOOK with sector/platter ordering inside a cylinder, plus a bad-sector table that doesn't survive contact with physics. The novelty is real relative to the cited ODSA/HDSA/SMCC/MRSA papers, but it's small. What the paper does well: the algorithm is concrete and step-by-step, and it's one of the few disk scheduling papers that explicitly considers platter selection and sector ordering at all. The idea of a bad-sector list with a preferred bit is at least a stated mechanism.\n\nThe soft spots are load-bearing. The performance claims—33.53% and 7.51% reductions in total disk access time—are computed under a cost model the authors define themselves (sector difference on an 8-sector track, transfer time = platter difference + 1, seek time = track distance). None of these units is calibrated to a real drive. Real seek time is nonlinear, rotational latency isn't a simple sector difference, and modern disks use zoning and command queuing. Six hand-constructed 20-request cases are not a benchmark. So the central 'better than all' claim has no external validity.\n\nThe bad-sector 'resolution' is internally inconsistent. The algorithm defines a bad sector as 'unreadable and non-writable' (Steps 23, 70), then BSM() flips a preferred bit and does the memory operation (Steps 4-8). If a sector is physically unreadable, flipping a bit doesn't recover data. There's also no remapping to spare sectors. This is not a minor detail; it's the second half of the paper's thesis.\n\nThe energy/heat savings are asserted as formulas (e*n-2, h*n-2) with no measurement, so they're definitional.\n\nWho is this for? Someone cataloging incremental LOOK variants might skim the algorithm, but no one should rely on the numbers. As a research claim, it doesn't deserve referee time as-is. A serious referee would reject it on validation grounds; the desk can do the same. My recommendation: desk reject, with a note that the sector/platter ordering idea is worth citing only as an example of an untested variant.","headline":"Minor LOOK variant with real but small novelty; the reported gains are arithmetic from a self-defined cost model and the bad-sector mechanism contradicts its own definition.","tokens_in":13536,"tokens_out":1712,"would_cite":false,"duration_ms":18543,"reading_group":"no","serious_thinker":"no","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"A LOOK-style scheduler that groups requests by cylinder cuts total disk access time by 33.53% and manages bad sectors.","keywords":["Disk scheduling","Bad-sector management","Seek time","Rotational latency","Data transfer time","Multi-platter hard disk","LOOK algorithm","Operating systems"],"falsifier":"A concrete falsifier: run the same six request patterns on a real hard disk (or a validated drive simulator with actual seek curves, rotational position, and transfer rates) and compare MODSBSM's total I/O time against LOOK, C-LOOK, and the five derived algorithms; the central claim fails if the total access time does not come out roughly one-third below the traditional set and 7.51% below the derived set. A second test: take a genuinely defective physical sector, attempt two reads, and see whether a stored preferred bit yields correct data where ECC and remapping would normally be required.","tokens_in":12449,"feed_emoji":"💾","tokens_out":8449,"duration_ms":83225,"temperature":0.7,"pith_summary":"The paper proposes MODSBSM, a disk scheduler that first sorts the request queue by track, then decides the arm's direction by comparing the distance to the lowest and highest requested tracks. When the head reaches a track, the scheduler completes every request on that whole cylinder—ordering sectors and platters directionally—before moving on, so it attacks rotational latency and head-switch transfer time rather than seek time alone. Across six twenty-request workloads on single- and multi-platter disks, the paper reports a 33.53% reduction in total disk access time relative to six traditional algorithms and a 7.51% reduction relative to five recent seek-time-optimized LOOK variants. The same pass maintains a bad-sector list: an index that fails twice is recorded, and later reads use a stored preferred bit, which the authors estimate saves n−2 retries per bad index in power and heat. The intended contribution is a single ordering discipline plus a defect-handling table that treats the hard disk as a multi-platter physical device.","feed_headline":"33.53% faster disk access from a cylinder-first scheduler","feed_subtitle":"A LOOK-style scheduler orders sectors and platters within each track, cutting access time and detecting bad sectors.","key_machinery":"The load-bearing object is a physical-address ordering of the request queue: a linked list where each node holds platter, track, sector, read/write flag, and a bad-sector index (BSI). The list is sorted by track, and the arm chooses a direction by comparing LD, the distance from the initial head track to the first request's track, with RD, the distance to the last request's track. Whichever direction is chosen, the scheduler batches all requests on one track and cylinder, ordering them by sector and then platter so the actuator's head stack serves the entire cylinder while it is in position. Rotational latency is charged as the signed sector difference on an eight-sector track, and data transfer time as the platter difference plus one, so the ordering directly determines the reported savings. A separate Bad-Sector List records indices whose BSI reaches two; the BSM function then reads or writes using a stored preferred bit, flipping it once if the first guess fails.","core_discovery":"The central claim is that optimizing only seek time, as traditional and recent LOOK-style algorithms do, leaves rotational latency and data transfer time on the table; a scheduler that also orders requests within a cylinder can reduce all three. After sorting requests by track and choosing the nearer end of the request range, MODSBSM visits each cylinder once, reading its sectors in ascending or descending order and its platters in the matching order, so sector gaps and platter-to-platter head switches are counted exactly under the paper's model. The paper's six cases, each with twenty requests, give MODSBSM a total disk access time of 1886 units versus 2228 for the best traditional LOOK and 1984 for the best recent derived variant; it phrases this as a 33.53% improvement over traditional algorithms and 7.51% over five derived algorithms. The algorithm's second, independent claim is that a sector whose bad-sector index reaches two is moved into a bad-sector table and resolved by storing a preferred bit, so the drive does not retry the same failed location repeatedly.","pith_inferences":["The paper's cost model uses an eight-sector track and unit transfer times; with zone bit recording, on-drive caches, and native command queuing, the sector-gap ordering's advantage is likely smaller than the reported 7.51% margin.","The bad-sector preferred-bit mechanism can be tested apart from scheduling: if sectors with real media defects are already remapped by the drive firmware, the scheduler's bad-sector list would mostly see uncorrectable ECC errors, and flipping a preferred bit would not recover data.","A natural transfer of the idea is to SSDs or NVMe, where the equivalent of cylinder locality is logical-block and page locality and the costs are erase/write latency and wear; the paper only lists SSDs as future work, so this is an extension rather than a claim."],"forward_implications":["If the ordering result holds on real hardware, a disk scheduler can reduce all three access-time components at once by serving every request on a cylinder before moving the arm, not just by minimizing head travel.","The reported figures translate the rule into numbers: 33.53% lower total disk access time than the six traditional algorithms and 7.51% lower than the five recent LOOK-style variants on the paper's six single- and multi-platter workloads.","With a bad-sector list, a sector that fails twice is recorded with a preferred bit, and later reads skip repeated retries; the paper estimates this removes n−2 unnecessary reads per bad index, lowering both power draw and heat.","Because the actuator arm moves all read/write heads together, the cylinder-first traversal matches the physical geometry of multi-platter drives, which the paper argues earlier single-platter-oriented algorithms ignore.","The algorithm's per-request structure (platter, track, sector, read/write flag, bad-sector index) gives the operating system a concrete data structure for scheduling and defect handling in one pass."],"supporting_citations":[{"why":"Provides the comparative performance-measure baseline (seek time, rotational latency, transfer time) used to compare all algorithms.","marker":"[6]"},{"why":"RP-10, a reformed FCFS/LOOK variant, is one of the five derived algorithms the proposed algorithm must beat.","marker":"[10]"},{"why":"ODSA, an optimized LOOK-style algorithm, is a baseline for the seek-time-focused comparison.","marker":"[11]"},{"why":"The heuristic disk scheduling algorithm presented there serves as the HDSA baseline in the comparison table.","marker":"[12]"},{"why":"SMCC, a sort-mid-current-comparison algorithm, is a derived baseline whose seek-time performance is compared directly.","marker":"[13]"},{"why":"MRSA, the median-range disk scheduling algorithm, is a derived baseline for the comparative analysis.","marker":"[14]"},{"why":"SRLF and SATF supply the earlier attempt to reduce rotational latency, motivating that metric in the comparison.","marker":"[16]"},{"why":"Provides the analysis of hard-drive energy consumption used to support the claimed power savings.","marker":"[20]"},{"why":"Supplies the roughly 100 femtojoules per-bit energy figure used in the bad-sector energy-conservation calculation.","marker":"[21]"}],"fun_headline_variants":["Cylinder-first scheduler cuts disk access 33.53%","Bad-sector-aware scheduler speeds disk I/O by a third","Track-aware ordering reduces seek and rotation delays","MODSBSM slashes access time and manages bad sectors","Optimized disk scheduler: 33.53% faster, bad-sector smart"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The reported gains rest on a synthetic cost model in which seek, rotational latency, and transfer times are unit costs (one per track, one per sector gap on an eight-sector track, one per platter difference plus one), and on the assumption that a twice-failed sector can be recovered by storing and flipping a preferred bit; if real drive timings or real defect behavior differ, the 33.53% and 7.51% margins could shrink or disappear.","fun_headline_variants_meta":{"raw":{"variants":["Cylinder-first scheduler cuts disk access 33.53%","Bad-sector-aware scheduler speeds disk I/O by a third","Track-aware ordering reduces seek and rotation delays","MODSBSM slashes access time and manages bad sectors","Optimized disk scheduler: 33.53% faster, bad-sector smart"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000285,"raw_usage":{"total_tokens":1676,"prompt_tokens":938,"completion_tokens":738,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":554,"completion_tokens_details":{"reasoning_tokens":653}},"tokens_in":554,"tokens_out":738,"duration_ms":7281,"temperature":1.0,"reasoning_tokens":653,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T15:21:09.126376+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A concrete falsifier: run the same six request patterns on a real hard disk (or a validated drive simulator with actual seek curves, rotational position, and transfer rates) and compare MODSBSM's total I/O time against LOOK, C-LOOK, and the five derived algorithms; the central claim fails if the total access time does not come out roughly one-third below the traditional set and 7.51% below the derived set. A second test: take a genuinely defective physical sector, attempt two reads, and see whether a stored preferred bit yields correct data where ECC and remapping would normally be required.","supporting_citations":[{"cited_title":"Performance Analysis of Disk Scheduling Algorithms","cited_arxiv_id":null,"evidence_quote":"Provides the comparative performance-measure baseline (seek time, rotational latency, transfer time) used to compare all algorithms."},{"cited_title":"International Journal of Computer Applications, Vol","cited_arxiv_id":null,"evidence_quote":"RP-10, a reformed FCFS/LOOK variant, is one of the five derived algorithms the proposed algorithm must beat."},{"cited_title":"Design and Performance Evaluation of an Optimized Disk Scheduling Algorithm (ODSA)","cited_arxiv_id":"1403.0334","evidence_quote":"ODSA, an optimized LOOK-style algorithm, is a baseline for the seek-time-focused comparison."},{"cited_title":"Nasim Akhter, and Mohammod Abdul Kashem, (2013) ―A New Heuristic Disk Scheduling Algorithm‖","cited_arxiv_id":null,"evidence_quote":"The heuristic disk scheduling algorithm presented there serves as the HDSA baseline in the comparison table."},{"cited_title":"International Journal of Computer Application, Vol","cited_arxiv_id":null,"evidence_quote":"MRSA, the median-range disk scheduling algorithm, is a derived baseline for the comparative analysis."},{"cited_title":"In Database Systems for Advanced Applications, pp 395 -402, DOI: 10.1142/9789814503730_0045","cited_arxiv_id":null,"evidence_quote":"SRLF and SATF supply the earlier attempt to reduce rotational latency, motivating that metric in the comparison."},{"cited_title":"In 2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems, IEEE, (2008, September) p p","cited_arxiv_id":null,"evidence_quote":"Provides the analysis of hard-drive energy consumption used to support the claimed power savings."},{"cited_title":"coursework for PH240 Stanford University, 2018, http://large.stanford.edu/courses/2018/ph240/jiang2/ (accessed on 09/06/2019) Authors Amar Ranjan Dash obtained his B","cited_arxiv_id":null,"evidence_quote":"Supplies the roughly 100 femtojoules per-bit energy figure used in the bad-sector energy-conservation calculation."}],"review_version":1}