Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
97
Adding Contracts to Java with Handshake
, 1998
"... Contracts describe an agreement between the writer and the user of a class. Their use enhances programmer productivity and program reliability, especially in library code. Handshake provides contracts for Java classes and interfaces in the form of class invariants and method pre- and postconditions ..."
Abstract
-
Cited by 42 (0 self)
- Add to MetaCart
Contracts describe an agreement between the writer and the user of a class. Their use enhances programmer productivity and program reliability, especially in library code. Handshake provides contracts for Java classes and interfaces in the form of class invariants and method pre
A Case for Handshake in Nanophotonic Interconnects
"... Abstract — Nanophotonics has been proposed to design low latency and high bandwidth NOC for future Chip Multi-Processors (CMPs). Recent nanophotonic NOC designs adopt the token-based arbitration coupled with credit-based flow control, which leads to low bandwidth utilization. In this work, we propos ..."
Abstract
- Add to MetaCart
schemes can reduce the communication delay by up to 59%. The basic handshake schemes add only 0.4 % hardware overhead for optical components and negligible power consumption. In addition, the performance of the handshake schemes is independent of on-chip buffer space, which makes them feasible in a large
SAS: Source Asynchronous Signaling Protocol for Asynchronous Handshake Communication Free From Wire Delay Overhead
"... Abstract — Asynchronous handshake protocol communication is accomplished by sending data down a communication link coupled with data validity information. Flow control is established by acknowledging the receipt of data, thereby enabling transmission of new data down the link. Handshake protocols op ..."
Abstract
- Add to MetaCart
Abstract — Asynchronous handshake protocol communication is accomplished by sending data down a communication link coupled with data validity information. Flow control is established by acknowledging the receipt of data, thereby enabling transmission of new data down the link. Handshake protocols
A quantum-safe circuitextension handshake for Tor. Eprint
, 2015
"... Abstract. We propose a method for integrating NTRUEncrypt into the ntor key exchange protocol as a means of achieving a quantum-safe variant of forward secrecy. The proposal is a minimal change to ntor, essentially consisting of an NTRUEncrypt-based key exchange performed in parallel with the ntor h ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
handshake. Performance figures are provided demonstrating that the client bears most of the additional overhead, and that the added load on the router side is acceptable. We make this proposal for two reasons. First, we believe it to be an interesting case study into the practicality of quantum
Capacity limits of cognitive radio with distributed and dynamic spectral activity,” Journal paper in preparation
"... Abstract — We investigate the capacity of opportunistic communication in the presence of dynamic and distributed spectral activity, i.e. when the time varying spectral holes sensed by the cognitive transmitter are correlated but not identical to those sensed by the cognitive receiver. Using the info ..."
Abstract
-
Cited by 80 (4 self)
- Add to MetaCart
when the communication occurs in bursts of only 3 − 5 symbols. The value of handshake overhead is investigated for both lightly loaded and heavily loaded systems. We find that the capacity benefits of overhead information flow from the transmitter to the receiver is negligible while feedback
No-Handshake Asynchronous Survivor Memory Unit for a Viterbi Decoder
"... Abstract—The Survivor Memory Unit (SMU) is a vital part of a Viterbi decoder design. So far, classical implementations of SMU employ the register exchange or the trace back approaches. In the conventional trace back implementation, a read-write RAM architecture is generally adopted which requires a ..."
Abstract
- Add to MetaCart
large size of memory. This gives the SMU design both area and power overhead. This paper presents a new no-handshake asynchronous approach to implement the trace back method. The SMU design based on this new architecture is a mixed synchronous and asynchronous circuit. Post-layout simulation results
Towards Energy Consumption Evaluation of the SSL Handshake Protocol in Mobile Communications
"... Abstract—Secure Sockets Layer (SSL) protocol is the most popular security protocol, which provides confidentiality, au-thentication and integrity protection in Internet transactions. Nowadays, a large portion of them are executed by battery-powered handheld devices, such as personal digital assistan ..."
Abstract
- Add to MetaCart
), and ver-ification errors, which overhead client-side energy consumption. In turn, both probabilistic and quantitative verification results are derived. The first ones validate the successful completion of handshakes and the later exhibit the impact of various parame-ters, such as cipher suites
Attacking control overhead to improve synthesised asynchronous circuit performance
- in Proc. International Conf. Computer Design (ICCD). IEEE Computer
, 2005
"... The development of robust synthesis techniques and tools is important if asynchronous design is to gain more widespread acceptance. Handshake circuits are a method of constructing asynchronous circuits from a set of modular components connected by handshake channels. They offer a level of abstractio ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
examines the problem of con-trol overhead in handshake circuits and proposes new hand-shake component specifications and implementations that significantly reduce this overhead. These changes are incorporated into the Balsa synthesis system and are shown to produce a doubling of the perfor-mance of a 32
Hardware Overhead Reduction of a QDI Booth Multiplier
"... This paper presents a new method to implement a multiplier using the Quasi Delay Insensitive (QDI) approach. QDI circuits allow unbounded delays on wires and gates, and require the difference among the delays in forks to be less than the delays of their terminating gates. To implement the Booth mult ..."
Abstract
- Add to MetaCart
to the resulting circuits their considerable overhead due to the implementation of handshaking protocols. In our proposed method, the overhead is reduced 50 % by separating the control and data path units. This solution increases the forks, and causes complexity in physical implementation. By applying some
Rateless Codes and Big Downloads
, 2003
"... This paper presents a novel algorithm for downloading big files from multiple sources in peer-to-peer networks. The algorithm is simple, but offers several compelling properties. It ensures low handshaking overhead between peers that download files (or parts of a files) from each other. It is comput ..."
Abstract
-
Cited by 69 (1 self)
- Add to MetaCart
This paper presents a novel algorithm for downloading big files from multiple sources in peer-to-peer networks. The algorithm is simple, but offers several compelling properties. It ensures low handshaking overhead between peers that download files (or parts of a files) from each other
Results 1 - 10
of
97
