Amortized efficiency of list update and paging rules
Communications of the ACM
Minimizing schedule length subject to minimum flow time
SIAM Journal on Computing
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
LogGP: incorporating long messages into the LogP model for parallel computation
Journal of Parallel and Distributed Computing
TCP dynamic acknowledgment delay (extended abstract): theory and practice
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Minimizing the flow time without migration
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
SIAM Journal on Computing
A guessing game and randomized online algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On-line analysis of the TCP acknowledgment delay problem
Journal of the ACM (JACM)
Dynamic TCP acknowledgement and other stories about e/(e-1)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A faster off-line algorithm for the TCP acknowledgement problem
Information Processing Letters
Fast Measurement of LogP Parameters for Message Passing Platforms
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Performance Analysis of Packet Bundling Techniques in DIS
DIS-RT '99 Proceedings of the 3rd International Workshop on Distributed Interactive Simulation and Real-Time Applications
Minimizing flow time nonclairvoyantly
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Dynamic TCP acknowledgment with sliding window
Theoretical Computer Science
Optimally competitive list batching
Theoretical Computer Science
On time lookahead algorithms for the online data acknowledgement problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Dynamic tcp acknowledgment with sliding window
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Hi-index | 0.00 |
When messages, which are to be sent point-to-point in a network, become available at irregular intervals, a decision must be made each time a new message becomes available as to whether it should be sent immediately or if it is better to wait for more messages and send them all together. Because of physical properties of the networks, a certain minimum amount of time must elapse in between the transmission of two packets. Thus, whereas waiting delays the transmission of the current data, sending immediately may delay the transmission of the next data to become available even more. We propose a new quality measure and derive optimal deterministic and randomized algorithms for this on-line problem.