# Edward G. Coffman Jr.

According to our database

^{1}, Edward G. Coffman Jr.## Awards

## IEEE Fellow

IEEE Fellow 1985, "For contributions to the theory of computer operating systems.".

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepages:

#### On csauthors.net:

## Bibliography

2016

Normal-form preemption sequences for an open problem in scheduling theory.

J. Scheduling, 2016

2015

How small are shifts required in optimal preemptive schedules?

J. Scheduling, 2015

Structural Properties of an Open Problem in Preemptive Scheduling.

CoRR, 2015

2014

Performance evaluation of fragmented structures: A theoretical study.

Perform. Eval., 2014

2013

A particle process underlying SSD storage structures.

SIGMETRICS Performance Evaluation Review, 2013

2012

Uptime and downtime analysis for hierarchical redundant systems in telecommunications.

SIGMETRICS Performance Evaluation Review, 2012

Synthesis of local-rule processes: successes and challenges (abstract only).

SIGMETRICS Performance Evaluation Review, 2012

A performance analysis of channel fragmentation in dynamic spectrum access systems.

Queueing Syst., 2012

An efficient algorithm for finding ideal schedules.

Acta Inf., 2012

2011

CAUCHY localization: a distributed computation of WSNs.

SIGMETRICS Performance Evaluation Review, 2011

Minimalist counting in sensor networks (Noise helps).

Ad Hoc Networks, 2011

Computer Storage Fragmentation: Pioneering Work of Brian Randell.

Proceedings of the Dependable and Historic Computing, 2011

2010

Channel Fragmentation in Dynamic Spectrum Access Systems - a Theoretical Study

CoRR, 2010

Strategy vs risk in margining portfolios of options.

4OR, 2010

Channel fragmentation in dynamic spectrum access systems: a theoretical study.

Proceedings of the SIGMETRICS 2010, 2010

A Computational Study of Margining Portfolios of Options by Two Approaches.

Proceedings of the Information Systems, Technology and Management, 2010

2008

Self-assembling sweep-and-sleep sensor systems.

SIGMETRICS Performance Evaluation Review, 2008

Random-order bin packing.

Discrete Applied Mathematics, 2008

Self-Organizing Sleep-Wake Sensor Systems.

Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008

Design of Local-Rule Protocols for Large-Scale File-Sharing Networks.

Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008

Cyclic Cellular Automata: A Tool for Self-Organizing Sleep Scheduling in Sensor Networks.

Proceedings of the 7th International Conference on Information Processing in Sensor Networks, 2008

High Performance Sleep-Wake Sensor Systems Based on Cyclic Cellular Automata.

Proceedings of the 7th International Conference on Information Processing in Sensor Networks, 2008

Stochastic Counting in Sensor Networks, or: Noise Is Good.

Proceedings of the Distributed Computing in Sensor Systems, 2008

2007

Variable-Sized Bin Packing and Bin Covering.

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Variants of Classical One-Dimensional Bin Packing.

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Performance Guarantees for One-Dimensional Bin Packing.

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

A Classification Scheme for Bin Packing Theory.

Acta Cybern., 2007

Retransmission in OBS networks with fiber delay lines.

Proceedings of the Fourth International Conference on Broadband Communications, 2007

2006

Free-Drop TCP.

SIGMETRICS Performance Evaluation Review, 2006

Approximation Algorithms for Extensible Bin Packing.

J. Scheduling, 2006

On Times to Compute Shapes in 2D Tile Self-assembly.

Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

2005

Self-correcting Self-assembly: Growth Models and the Hammersley Process.

Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

Efficient performance analysis of asynchronous systems based on periodicity.

Proceedings of the 3rd IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis, 2005

2004

Content distribution for seamless transmission.

SIGMETRICS Performance Evaluation Review, 2004

Self assembly times in DNA-based computation.

SIGMETRICS Performance Evaluation Review, 2004

Flood search under the California Split rule.

Oper. Res. Lett., 2004

DNA-Based Computation Times.

Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

2003

An asymptotically optimal greedy algorithm for large optical burst switching systems.

SIGMETRICS Performance Evaluation Review, 2003

JACM 1976-1979.

J. ACM, 2003

Ideal preemptive schedules on two processors.

Acta Inf., 2003

2002

Flood search under the California split strategy.

SIGMETRICS Performance Evaluation Review, 2002

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing.

SIAM Review, 2002

The Dyadic Stream Merging Algorithm.

J. Algorithms, 2002

Closed On-Line Bin Packing.

Acta Cybern., 2002

Packing rectangles in a strip.

Acta Inf., 2002

2001

Optimizing the Number of Robots for Web Search Engines.

Telecommunication Systems, 2001

Threshold policies for single-resource reservation systems.

SIGMETRICS Performance Evaluation Review, 2001

Kelly's LAN model revisited.

SIGMETRICS Performance Evaluation Review, 2001

Optimal Carrier Sharing in Wireless TDMA.

Journal of Interconnection Networks, 2001

Bandwidth Packing.

Algorithmica, 2001

Approximation algorithms for extensible bin packing.

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Controlling the robots of Web search engines.

Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 2001

2000

Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings.

SIAM J. Discrete Math., 2000

Average-Case Analysis of Retangle Packings.

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

The interval packing process of linear networks.

SIGMETRICS Performance Evaluation Review, 1999

Performance of the move-to-front algorithm with Markov-modulated request sequences.

Oper. Res. Lett., 1999

Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems.

Math. Oper. Res., 1999

Fluid Limits, Bin Packing, and Stochastic Analysis of Algorithms.

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times.

SIAM J. Comput., 1998

A Note on Limited Preemption.

Parallel Processing Letters, 1998

Polling Systems in Heavy Traffic: A Bessel Process Limit.

Math. Oper. Res., 1998

Packing Random Intervals On-Line.

Algorithmica, 1998

1997

Bin packing with discrete item sizes, part II: Tight bounds on First Fit.

Random Struct. Algorithms, 1997

An Approximate Model of Processor Communication Rings Under Heavy Load.

Inf. Process. Lett., 1997

Optimal Fault-Tolerant Computing on Multiprocessor Systems.

Acta Inf., 1997

1996

Mutual Exclusion Scheduling.

Theor. Comput. Sci., 1996

1994

The Processor Minimization Problem with Independent Waiting-Time Constraints.

Theor. Comput. Sci., 1994

Processor-Shared Buffers with Reneging.

Perform. Eval., 1994

1993

Stochastic analysis of a slotted FIFO communication channel.

IEEE Trans. Information Theory, 1993

A Stochastic Checkpoint Optimization Problem.

SIAM J. Comput., 1993

Optimal Stochastic Allocation of Machines Under Waiting-Time Constraints.

SIAM J. Comput., 1993

Stochastic Machine Minimization with Constant Service Times.

Math. Oper. Res., 1993

Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling.

J. ACM, 1993

Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms.

Algorithmica, 1993

Scheduling Saves in Fault-Tolerant Computations.

Acta Inf., 1993

Markov chains, computer proofs, and average-case analysis of best fit bin packing.

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992

Paths through a maze of rectangles.

Networks, 1992

Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands.

Operations Research, 1992

Scheduling Checks and Saves.

INFORMS Journal on Computing, 1992

1991

Controlled stochastic model of a communication system with multiple sources.

IEEE Trans. Information Theory, 1991

SIAM J. Discrete Math., 1991

Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Probabilistic analysis of packing and partitioning algorithms.

Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-53272-9, 1991

1990

First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted Space.

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989

A Note Extending the Analysis of Two-Head Disk Systems to More General Seek-Time Characteristics.

IEEE Trans. Computers, 1989

Algorithms for Packing Squares: A Probabilistic Analysis.

SIAM J. Comput., 1989

A Provably Efficient Algorithm for Dynamic Storage Allocation.

J. Comput. Syst. Sci., 1989

Optimal Scheduling of Products with Two Subassemblies on a Single Machine.

Operations Research, 1989

1988

Optimal directory placement on disk storage devices.

J. ACM, 1988

1987

The forwarding index of communication networks.

IEEE Trans. Information Theory, 1987

Polling and Greedy Servers on a Line.

Queueing Syst., 1987

Bin packing with divisible item sizes.

J. Complexity, 1987

Two Queues with Alternating Service Periods.

Proceedings of the Performance '87, 1987

1986

A continuous polling system with constant service times.

IEEE Trans. Information Theory, 1986

Queueing Models of Secondary Storage Devices.

Queueing Syst., 1986

A Provably Efficient Algorithm for Dynamic Storage Allocation

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Analysis of a Conveyor Queue in a Flexible Manufacturing System.

Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, 1986

1985

Algorithms for Resolving Conflicts in Dynamic Storage Allocation

J. ACM, April, 1985

On the Asymptotic Optimality of First-Fit Storage Allocation.

IEEE Trans. Software Eng., 1985

A Stochastic Model of Fragmentation in Dynamic Storage Allocation.

SIAM J. Comput., 1985

Scheduling File Transfers.

SIAM J. Comput., 1985

Sequencing Problems in Two-Server Systems.

Math. Oper. Res., 1985

On the Expected Relative Performance of List Scheduling.

Operations Research, 1985

1984

Dynamic, First-Fit Packings in Two or More Dimensions

Information and Control, April, 1984

A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniform Processors.

IEEE Trans. Computers, 1984

Insertion and Compaction Algorithms in Sequentially Allocated Storage.

SIAM J. Comput., 1984

Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum.

Math. Oper. Res., 1984

A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors.

Math. Oper. Res., 1984

Optimum Head Separation in a Disk System with Two Read/Write Heads.

J. ACM, 1984

A Performance Guarantee for the Greedy Set-Partitioning Algorithm.

Acta Inf., 1984

Recent Progress in the Performance Evaluation of Fundamental Allocation Algorithms.

Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1984

Expected Makespans for Largest-First Multiprocessor Scheduling.

Proceedings of the Performance '84, 1984

1983

Instruction Sets for Evaluating Arithmetic Expressions

J. ACM, July, 1983

Dynamic Bin Packing.

SIAM J. Comput., 1983

Diffusion approximations for storage processes in computer systems.

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 1983

Scheduling File Transfers in a Distributed Network.

Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1983

Diffusion Approximations for Computer/Communications Systems.

Proceedings of the Computer Performance and Reliability, 1983

1982

A Data Base Replication Analysis Using an M/M/m Queue with Service Interruptions.

SIGMETRICS Performance Evaluation Review, 1982

On the Expected Performance of Scanning Disks.

SIAM J. Comput., 1982

A Two-Dimensional Bin-Packing Model of Preemptive, FIFO Storage Allocation.

J. Algorithms, 1982

1981

Optimization of the Number of Copies in a Distributed Data Base.

IEEE Trans. Software Eng., 1981

An analysis of parallel-read sequential-write systems.

Perform. Eval., 1981

1980

A Stochastic Model of Bin-Packing

Information and Control, February, 1980

Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms.

SIAM J. Comput., 1980

Orthogonal Packings in Two Dimensions.

SIAM J. Comput., 1980

A Characterization of Waiting Time Performance Realizable by Single-Server Queues.

Operations Research, 1980

On the Comparison Between Single and Multiple Processor Systems.

Proceedings of the 7th Annual Symposium on Computer Architecture, May 1980, 1980

1979

Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation.

SIAM J. Comput., 1979

1978

An Application of Bin-Packing to Multiprocessor Scheduling.

SIAM J. Comput., 1978

A Class of FIFO Queues Arising in Computer Systems.

Operations Research, 1978

Bin Packing: Maximizing the Number of Pieces Packed.

Acta Inf., 1978

1977

On Scanning-Disks and the Analysis of their Steady State Behavior.

Proceedings of the Measuring, Modelling and Evaluating Computer Systems, 1977

Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation

Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976

On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single Server.

J. Comput. Syst. Sci., 1976

Errata: "Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices".

J. ACM, 1976

Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices.

J. ACM, 1976

Algorithms Minimizing Mean Flow Time: Schedule-Length Properties.

Acta Inf., 1976

A generalized bound on LPT sequencing.

Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 1976

1975

Analysis of Interleaved Memory Systems Using Blockage Buffers.

Commun. ACM, 1975

Selecting a Scheduling Rule that Meets Pre-Specified Response Time Demands.

Proceedings of the Fifth Symposium on Operating System Principles, 1975

1974

A Problem in Multiprogrammed Storage Allocation.

IEEE Trans. Computers, 1974

Synthesis of a Feedback Queueing Discipline for Computer Operation.

J. ACM, 1974

Scheduling Independent Tasks to Reduce Mean Finishing Time.

Commun. ACM, 1974

Algorithms for Minimizing Mean Flow Time.

IFIP Congress, 1974

1973

A Combinatorial Problem Related to Interleaved Memory Systems.

J. ACM, 1973

A Note on the Relative Performance of Two Disk Scanning Policies.

Inf. Process. Lett., 1973

Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract).

Proceedings of the Fourth Symposium on Operating System Principles, 1973

A Survey of Mathematical Results in Flow-Time Scheduling for Computer Systems.

Proceedings of the Gesellschaft für Informatik e.V., 1973

Operating Systems Theory

Prentice-Hall, 1973

1972

Analysis of Scanning Policies for Reducing Disk Seek Times.

SIAM J. Comput., 1972

A Study of Storage Partitioning Using a Mathematical Model of Locality.

Commun. ACM, 1972

Optimal Scheduling for Two-Processor Systems.

Acta Inf., 1972

Consistency of Synchronization Nets using P and V Operations

Proceedings of the 13th Annual Symposium on Switching and Automata Theory, 1972

1971

On the Performance of Interleaved Memories with Multiple-Word Bandwidths.

IEEE Trans. Computers, 1971

System Deadlocks.

ACM Comput. Surv., 1971

Performance Predictions for Extended Paged Memories.

Acta Inf., 1971

A Study of Storage Partitioning Using a Mathematical Model (Abstract).

Proceedings of the Third Symposium on Operating System Principles, 1971

Nearly Optimal Binary Search Trees.

IFIP Congress (1), 1971

Priority Paging Algorithms and the Extension Problem

Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

1970

Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems.

J. ACM, 1970

Waiting Time Distributions for Processor-Sharing Systems.

J. ACM, 1970

File structures using hashing functions.

Commun. ACM, 1970

Sequencing Tasks in Multiprocess Systems to Avoid Deadlocks

Proceedings of the 11th Annual Symposium on Switching and Automata Theory, 1970

Deadlock Problems in Computer Systems.

Proceedings of the Rechnerstrukturen und Betriebsprogrammierung, 1970

A study of interleaved memory systems.

Proceedings of the American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1970 Spring Joint Computer Conference, 1970

1969

Optimal Preemptive Scheduling on Two-Processor Systems.

IEEE Trans. Computers, 1969

On the Tradeoff Between Response and Preemption Costs in a Foreground-Background Computer Service Discipline.

IEEE Trans. Computers, 1969

Erratum: "Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System".

J. ACM, 1969

Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System.

J. ACM, 1969

Organizing Matrices and Matrix Operations for Paged Memory Systems.

Commun. ACM, 1969

1968

A Random-Walk Model of a Queue Storage Problem.

IEEE Trans. Computers, 1968

On the Motion of an Unbounded, Markov Queue in Random Access Storage.

IEEE Trans. Computers, 1968

A Simple Probability Model Yielding Performance Bounds for Modular Memory Systems.

IEEE Trans. Computers, 1968

Feedback Queueing Models for Time-Shared Systems.

J. ACM, 1968

Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping.

J. ACM, 1968

Further experimental data on the behavior of programs in a paging environment.

Commun. ACM, 1968

Computer scheduling methods and their countermeasures.

Proceedings of the American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1968 Spring Joint Computer Conference, Atlantic City, NJ, USA, 30 April, 1968

1967

Distribution of Attained Service in Time-Shared Systems.

J. Comput. Syst. Sci., 1967