A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Using metrics for proof rules for recursively defined delay-insensitive specifications
Proceedings Third International Symposium on Advanced Research in Asynchronous Circuits and Systems
Preserved Fulltext
An advantage of algebraic specifications of delay insensitive asynchronous processes over most other formalisms is that it allows the recursive definition of processes, and correctness proofs of an implementation ...
Until now, the intuitive induction rule has never been formalized, and formalizing it, as we do in this paper, shows that extreme care has to be taken to phrase the proof rule that is being used. ...
We would like to thank the members of the Groningen reading club, especially Rutger Dijkstra, for their useful input, comments and ideas. ...
doi:10.1109/async.1997.587173
dblp:conf/async/MallonU97
fatcat:vcezyezla5hwzbhzsutfzmdcri
Balanced fair resource sharing in computer clusters
2017
Performance evaluation (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We show that the corresponding queue is quasi-reversible and use this property to design a scheduling algorithm achieving balanced fair sharing of the service capacity. ...
Indeed, the insensitivity property satisfied by balanced fairness was used for instance in [6, 22, 23] to obtain simple and explicit recursion formulas for the performance metrics. ...
Performance metrics. We measure the performance in terms of mean service rate and mean delay. Let φ i (x) be the service rate of class-i jobs in state x, as defined by (8) . ...
doi:10.1016/j.peva.2017.08.006
fatcat:c5c54vbzanck5jae3g4vjrd374
A Level-Encoded Transition Signaling Protocol for High-Throughput Asynchronous Global Communication
2008
2008 14th IEEE International Symposium on Asynchronous Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
A new delay-insensitive data encoding scheme for global communication, level-encoded transition signaling (LETS), is introduced. ...
Two alternative 1-of-4 LETS codes are proposed, and efficient hardware for completion detection and conversion to return-to-zero protocols is introduced. ...
These benefits have encouraged recent applications using LEDR encoding [4, 9] . The goal of this paper is to explore more efficient protocols for delay-insensitive communication. ...
doi:10.1109/async.2008.24
dblp:conf/async/McGeeAMN08
fatcat:gizde3d3cvcwlhx7mysihkukua
Reduced complexity symbol detectors with parallel structure for ISI channels
1994
IEEE Transactions on Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
One such suboptimal detector is shown to be the same as the minimum-metric Viterbi detector. ...
Absrracr -The problem of practical realization of the optimal fixed-delay symbol-by-symbol detection algorithm, which is optimum in the sense of minimizing the symbol error probability, given a delay constraint ...
Frank Kschischang for his helpful suggestions and enlightening discussions. ...
doi:10.1109/tcomm.1994.582868
fatcat:cmeg4onxwbbsdcduqtjtrknboa
Formal Verification of Explicitly Parallel Microprocessors
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Acknowledgments For their contributions to this research, we thank Mark Aagaard
Acknowledgements We wish to thank Byron Cook, Sava Krstic, and John Launchbury for their valuable contributions to this ...
The proof is discussed in Sect. 7. For now, we would like to apply this theorem to define some simple recursive functions over lazy lists. ...
One approach would be to define a suitable metric space[l] and use the corresponding distance function, which returns either a rational or real number, given any two elements in the domain of the metric ...
doi:10.1007/3-540-48153-2_4
fatcat:pd5w6ggq6fdpxfeqwiprqxintu
Hierarchical design of delay-insensitive systems
1990
IEE Proceedings E (Computers and Digital Techniques)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
system as such; delay-insensitivity is with respect to some specification. ...
It is obvious that time can play only a limited role in specifications, for, otherwise, no delay-insensitive circuit can satisfy it. ...
Encoding of data for delay-insensitive transmission is treated in [Ver88] . ...
doi:10.1049/ip-e.1990.0004
fatcat:7myrlugj2rglhe3rufhkqire5e
Dynamic Load Balancing with Tokens
2018
2018 IFIP Networking Conference (IFIP Networking) and Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Assuming a balanced fair sharing of the server resources, we show that the resulting dynamic load balancing is insensitive to the job size distribution. ...
The former are in charge of assigning jobs to servers upon their arrival in the system, while the latter are responsible for sharing the server resources between their assigned jobs. ...
Acknowledgement The author would like to thank Fabien Mathieu for his help with the proof of irreducibility provided in the appendix. ...
doi:10.23919/ifipnetworking.2018.8697018
dblp:conf/networking/Comte18
fatcat:5supg2ii5jb3nlrz64fitlnavy
Blind acquisition characteristics of PSP-based sequence detectors
1998
IEEE Journal on Selected Areas in Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Such sequences are defined and analytically characterized, resulting in asymptotic results on performance for joint ML channel and sequence estimators. ...
These sequences are those that cannot be distinguished by the joint maximum likelihood (ML) channel and sequence estimator or do not allow for a complete identification of the channel impulse response. ...
Paparisto for helpful discussions during the revision process. ...
doi:10.1109/49.730458
fatcat:stikvpyscnbahbowhtt4bgviim
Asymptotics of insensitive load balancing and blocking phases
2017
Queueing systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This generalizes the well-known Quality and Efficiency Driven (QED) regime or Halfin-Whitt regime for a one-dimensional queue, and leads to a generalized staffing rule for a given target blocking probability ...
In many systems, characterizing precisely the blocking probability allows to establish a performance trade-off between delay and losses. ...
be computed using a recursive formula. ...
doi:10.1007/s11134-017-9559-5
fatcat:tpfrgajtb5dp7iho4toli35jvi
Maximum-Likelihood Priority-First Search Decodable Codes for Combined Channel Estimation and Error Protection
[article]
2007
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Moreover, the structural codes that we construct by rules can now be maximum-likelihoodly decodable in terms of a newly derived recursive metric for use of the priority-first search decoding algorithm. ...
The extension code design for fast-fading channels is also presented. ...
In [2] , Chugg and Polydoros derived a recursive metric for joint maximum-likelihood (ML) decoding, and hint that the recursive metric may only be used with the sequential algorithms [1] . ...
arXiv:0712.2587v1
fatcat:k3osfetfl5etdf6cfi3ap3mjiq
Asymptotics of Insensitive Load Balancing and Blocking Phases
2016
Performance Evaluation Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This generalizes the well-known Quality and Efficiency Driven (QED) regime or Halfin-Whitt regime for a one-dimensional queue, and leads to a generalized staffing rule for a given target blocking probability ...
In many systems, characterizing precisely the blocking probability allows to establish a performance trade-off between delay and losses. ...
be computed using a recursive formula. ...
doi:10.1145/2964791.2901454
fatcat:vtyiggweijcyrlidtw6wiyfxvu
Asymptotics of Insensitive Load Balancing and Blocking Phases
2016
Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science - SIGMETRICS '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This generalizes the well-known Quality and Efficiency Driven (QED) regime or Halfin-Whitt regime for a one-dimensional queue, and leads to a generalized staffing rule for a given target blocking probability ...
In many systems, characterizing precisely the blocking probability allows to establish a performance trade-off between delay and losses. ...
be computed using a recursive formula. ...
doi:10.1145/2896377.2901454
dblp:conf/sigmetrics/JonckheereP16
fatcat:iqaawdmc5fhk3gqlu3slykjb3e
On robust network planning
2009
2009 7th International Workshop on Design of Reliable Communication Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A graph-theoretical metric, betweenness, in combination with network weight matrix is used to define a global quantity, network criticality, to characterize the robustness of a network. ...
This leads to a well-defined convex optimization problem to find the optimal weight matrix assignment to minimize network criticality. ...
The random-walk is defined on a Markov chain M with transition probability matrix P according to the following rule: pij = w ij k∈A(i) w ik if j ∈ A(i) 0 otherwise (1) where A(i) is the set of adjacent ...
doi:10.1109/drcn.2009.5340013
fatcat:yrsfqgowune2xab7yxbqtdbv2i
Asymptotics of Insensitive Load Balancing and Blocking Phases
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This generalizes the well-known Quality and Efficiency Driven (QED) regime or Halfin-Whitt regime for a one-dimensional queue, and leads to a generalized staffing rule for a given target blocking probability ...
We address the problem of giving robust performance bounds based on the study of the asymptotic behavior of the insensitive load balancing schemes when the number of servers and the load scales jointly ...
be computed using a recursive formula. ...
arXiv:1605.02996v1
fatcat:etnewsbkdfd6rgk2dugvj36qdm
Maximum-Likelihood Priority-First Search Decodable Codes for Combined Channel Estimation and Error Correction
2009
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Moreover, the systematically constructed codes can now be maximum-likelihoodly decoded with respect to the unknown-channel criterion in terms of a newly derived recursive metric for use by the priority-first ...
In this paper, a systematic construction is derived for a class of structured codes that support joint channel estimation and error correction. ...
Parkvall of the Royal Institute of Technology (KTH), Stockholm, Sweden, for kindly providing us their codes for further study in the preparation of this paper. ...
doi:10.1109/tit.2009.2025548
fatcat:mrzofbq64zcv3i2scrwjtokly4
« Previous
Showing results 1 — 15 out of 1,167 results