PERFORMANCE OF A SPECULATIVE TRANSMISSION SCHEME FOR SCHEDULING LATENCY REDUCTION

Abstract: This work was motivated by the need to achieve low latency in an input centrally-scheduled cell switch for high-performance computing applications; specifically, the aim is to reduce the latency incurred between issuance of a request and arrival of the corresponding grant. We introduce a speculative transmission scheme to significantly reduce the average latency by allowing cells to proceed without waiting for a grant. It operates in conjunction with any centralized matching algorithm to achieve a high maximum utilization. An analytical model is presented to investigate the efficiency of the speculative transmission scheme employed in a non-blocking N*NR input-queued crossbar switch with receivers R per output. The results demonstrate that the can be almost entirely eliminated for loads up to 50%. Our simulations confirm the analytical results.

[attachment=3145]

Performance of a Speculative Transmission Schemefor Scheduling-Latency Reduction

---

Project Team Members:
C.Dinesh (51206104014)
K.Selvaraj (51206104327)
S.Elumalai (51206104307)
N.Periyasamy (51206104320)

---

Abstract
Latency is the amount of time a message takes to traverse a system.
Low latency is a critical requirement in some switching applications , specifically in parallel computer interconnection networks.
In this latency comprises two components, namely.
Control-path latency
Data-path latency
We introduce a speculative transmission scheme to significantly reduce the average control-path latency by allowing cells to proceed without waiting for a grant, under certain conditions.
the control-path latency can be almost entirely eliminated for loads up to 50%

OBJECTIVE
The component of parallel computing systems is the interconnection network (ICTN).
To achieve a good system balance between computation and communication,
The ICTN must provide low latency, bandwidth, low error rates, and scalability, node with low latency being the most important requirement.
Index Terms:

Arbiters
electrooptic switches
modeling
packet
Switching
scheduling.
Existing System:


Control and data path-latencies comprise serialization and de-serialization delays, propagation delay, processing delay between request and response.

Proposed System

We propose a novel method to combine speculative and scheduled transmission in a cross bar switch.
Speculative modes of operation reduced latency at low utilization.
Scheduled modes of operation achieve high maximum throughput.

System Requirements:
Hardware:

PROCESSOR : PENTIUM IV 2.6 GHz
RAM : 512 MB DD RAM
MONITOR : 15 COLOR
HARD DISK : 20 GB
CDDRIVE : LG 52X
KEYBOARD : STANDARD 102 KEYS
MOUSE : 3 BUTTONS


Software:
Tools Used : JFrameBuilder
Operating System : Windowâ„¢s XP
Back End : SQL Server 2000
Front End : Java, Swing
ADVANTAGES

The speculative transmission that does not have to wait for grant hence low latency.

The scheduled transmission achieve high maximum throughput.

Bibliography or References

[1] R. Hemenway, R. Grzybowski, C. Minkenberg, and R. Luijten, Optical-packet-switched interconnect for supercomputer applications,OSA J. Opt. Netw., vol. 3, no. 12, pp. 900“913, Dec. 2004.
[2] C. Minkenberg, F. Abel, P. Müller, R. Krishnamurthy, M. Gusat, P.Dill, I. Iliadis, R. Luijten, B. R. Hemenway, R. Grzybowski, and E.Schiattarella, Designing a crossbar scheduler for HPC applications,IEEE Micro, vol. 26, no. 3, pp. 58“71, May/Jun. 2006.
[3] E. Oki, R. Rojas-Cessa, and H. Chao, A pipeline-based approach formaximal-sized matching scheduling in input-buffered switches, IEEE Commun. Lett., vol. 5, no. 6, pp. 263“265, Jun. 2001.
[4] C. Minkenberg, I. Iliadis, and F. Abel, Low-latency pipelined crossbar arbitration, in Proc. IEEE GLOBECOM 2004, Dallas, TX, Dec. 2004, vol. 2, pp. 1174“1179.
[5] C. Minkenberg, R. Luijten, F. Abel, W. Denzel, and M. Gusat, Current issues in packet switch design, ACM Comput. Commun. Rev., vol. 33, no. 1, pp. 119“124, Jan. 2003.
[6] C. Minkenberg, F. Abel, P. Müller, R. Krishnamurthy, and M. Gusat,Control path implementation of a low-latency optical HPC switch, inProc. Hot Interconnects 13, Stanford, CA, Aug. 2005, pp. 29“35.
[7] C.-S. Chang, D.-S. Lee, and Y.-S. Jou, Load-balanced Birkhoff-von Neumann switches, part I: One-stage buffering, Elsevier Comput.Commun., vol. 25, pp. 611“622, 2002.
[8] A. Tanenbaum, Computer Networks, 3rd ed. Englewood Cliffs, NJ: Prentice Hall, 1996.
[9] R. Krishnamurthy and P. Müller, An input queuing implementation for low-latency speculative optical switches, in Proc. 2007 Int. Conf.Parallel Processing Techniques and Applications (PDPTA™07), Las Vegas, NV, Jun. 2007, vol. 1, pp. 161“167.
[10] H. Takagi, Queueing Analysis, Volume 3: Discrete-Time Systems. Amsterdam: North-Holland, 1993.


Query session ?

[attachment=9974]
Performance of a Speculative Transmission Scheme for Scheduling-Latency Reduction
Abstract:
This work was motivated by the need to achieve low latency in an input-queued centrally-scheduled cell switch for high-performance computing applications; specifically, the aim is to reduce the latency incurred between a request and response arrival of the corresponding grant. The minimum latency in switches with centralized scheduling comprises two components, namely, the control-path latency and the data-path latency, which in a practical high-capacity, distributed switch implementation can be far greater than the cell duration. We introduce a speculative transmission scheme to significantly reduce the average control-path latency by allowing cells to proceed without waiting for a grant, under certain conditions. It operates in conjunction with any centralized matching algorithm to achieve a high maximum utilization. Using this model, performance measures such as the mean delay and the rate of successful speculative transmissions are derived. The results demonstrate that the latency can be almost entirely eliminated between request and response for loads up to 50%. Our simulations confirm the analytical results.
Existing System:
• Brikoff-von-newmann Switch which is eliminate the scheduler. It incurs a worst-case latency penalty of N time slots. It has to wait for exactly N time slots for the next opportunity.
• Control and data path-latencies comprise serialization and de-serialization delays, propagation delay, processing delay between request and response.
Proposed System:
• We propose a novel method to combine speculative and scheduled transmission in a cross bar switch
• Speculative modes of operation reduced latency at low utilization.
• Scheduled modes of operation achieve high maximum throughput.
Advantage:
• The speculative transmission that does not have to wait for grant hence low latency.
• The scheduled transmission achieve high maximum throughput.
System Requirements:
Hardware:
PROCESSOR : PENTIUM IV 2.6 GHz
RAM : 512 MB DD RAM
MONITOR : 15” COLOR
HARD DISK : 20 GB
CDDRIVE : LG 52X
KEYBOARD : STANDARD 102 KEYS
MOUSE : 3 BUTTONS
Software:
Front End : Java, Swing
Tools Used : JFrameBuilder
Operating System : Window’s XP
Back End : SQL Server 2000

i need future enhancement for this project could u plzz help me out