M
Micha Hofri
Researcher at Worcester Polytechnic Institute
Publications - 60
Citations - 1453
Micha Hofri is an academic researcher from Worcester Polytechnic Institute. The author has contributed to research in topics: Queue & Queueing theory. The author has an hindex of 18, co-authored 59 publications receiving 1418 citations. Previous affiliations of Micha Hofri include Rice University & University of Houston.
Papers
More filters
Journal ArticleDOI
Disk scheduling: FCFS vs.SSTF revisited
TL;DR: An extensive simulation effort directed at evaluating the merits of two scheduling strategies, FCFS and SSTF, for moving-arm disks under stationary request arrival process seems to confirm the overall superiority of Shortest-Seek-Time-First (SSTF), particularly for medium and heavy traffic.
Journal ArticleDOI
Analysis of a stack algorithm for random multiple-access communication
TL;DR: An exact analysis is given of the main parameters that characterize the properties of the Capetanakis-Tsybakov-Mikhailov collision resolution algorithm with the free-access (continuous input) protocol.
Journal ArticleDOI
On the optimal control of two queues with server setup times and its analysis
Micha Hofri,Keith W. Ross +1 more
TL;DR: It is proved that in order to minimize the sum of discounted setup charges and holdings costs, the service at each queue should be exhaustive, a “threshold policy” is defined as a policy under which the server switches only when the other reaches a critical size.
Journal ArticleDOI
The coupon-collector problem revisited — a survey of engineering problems and computational methods
Arnon Boneh,Micha Hofri +1 more
TL;DR: A standard combinatorial problem is to estimate the number of coupons, drawn at random, needed to complete a collection of all possible m types, and two computational paradigms are shown that are well suited for this type of problems.