The following pages link to Edward G. jun. Coffman (Q948705):
Displayed 50 items.
- Optimal Stochastic Allocation of Machines under Waiting-Time Constraints (Q4032942) (← links)
- (Q4035170) (← links)
- The Gated Infinite-Server Queue: Uniform Service Times (Q4037676) (← links)
- Anaysis of interleaved memory systems using blockage buffers (Q4045632) (← links)
- (Q4051615) (← links)
- Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices (Q4076784) (← links)
- (Q4099211) (← links)
- (Q4138132) (← links)
- An Application of Bin-Packing to Multiprocessor Scheduling (Q4151721) (← links)
- An efficient algorithm for allocating paged, drum-like storage (Q4158467) (← links)
- A Class of FIFO Queues Arising in Computer Systems (Q4170241) (← links)
- Flow-Time Sequencing of Independent Tasks on Multiple Processors’<sup>*</sup> (Q4171852) (← links)
- (Q4182227) (← links)
- (Q4184311) (← links)
- A Stochastic Checkpoint Optimization Problem (Q4202217) (← links)
- (Q4205064) (← links)
- Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times (Q4210092) (← links)
- (Q4252387) (← links)
- Processor-shared buffers with reneging (Q4279041) (← links)
- Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling (Q4285627) (← links)
- Stochastic analysis of a slotted FIFO communication channel (Q4307368) (← links)
- COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS (Q4488669) (← links)
- Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings (Q4490793) (← links)
- (Q4508386) (← links)
- Space filling and depletion (Q4667993) (← links)
- Optimal selection of stochastic intervals under a sum constraint (Q4726037) (← links)
- Synthesis of a Feedback Queueing Discipline for Computer Operation (Q4766049) (← links)
- Scheduling independent tasks to reduce mean finishing time (Q4769981) (← links)
- A Problem in Multiprogrammed Storage Allocation (Q4776824) (← links)
- Queues served by a rotating ring (Q4849178) (← links)
- Stochastic limit laws for schedule makespans (Q4883748) (← links)
- The Maximum of a Random Walk and Its Application to Rectangle Packing (Q4950720) (← links)
- REDIALING POLICIES: OPTIMALITY AND SUCCESS PROBABILITIES (Q4955517) (← links)
- Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System (Q5184262) (← links)
- A Random-Walk Model of a Queue Storage Problem (Q5184272) (← links)
- Markov chains, computer proofs, and average-case analysis of best fit bin packing (Q5248510) (← links)
- Stochastic Machine Minimization with Constant Service Times (Q5287984) (← links)
- (Q5422555) (← links)
- On Times to Compute Shapes in 2D Tile Self-assembly (Q5452576) (← links)
- Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines (Q5488538) (← links)
- DNA Computing (Q5494337) (← links)
- Interarrival statistics for time sharing systems (Q5511151) (← links)
- Feedback Queueing Models for Time-Shared Systems (Q5556106) (← links)
- On the Motion of an Unbounded, Markov Queue in Random Access Storage (Q5556197) (← links)
- Markov chain analyses of multiprogrammed computer systems (Q5563769) (← links)
- Organizing matrices and matrix operations for paged memory systems (Q5563772) (← links)
- Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping (Q5566185) (← links)
- Optimal Preemptive Scheduling on Two-Processor Systems (Q5576025) (← links)
- Waiting Time Distributions for Processor-Sharing Systems (Q5594222) (← links)
- (Q5604886) (← links)