QPS-r: A cost-effective iterative switching algorithm for input-queued switches
In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Gong, Long [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2021transfer abstract |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand - 2012transfer abstract, an international journal, Amsterdam [u.a.] |
|---|---|
| Übergeordnetes Werk: |
volume:147 ; year:2021 ; pages:0 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.peva.2021.102197 |
|---|
| Katalog-ID: |
ELV053386272 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV053386272 | ||
| 003 | DE-627 | ||
| 005 | 20230626034736.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 210910s2021 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.peva.2021.102197 |2 doi | |
| 028 | 5 | 2 | |a /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001628.pica |
| 035 | |a (DE-627)ELV053386272 | ||
| 035 | |a (ELSEVIER)S0166-5316(21)00014-6 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 540 |q VZ |
| 100 | 1 | |a Gong, Long |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a QPS-r: A cost-effective iterative switching algorithm for input-queued switches |
| 264 | 1 | |c 2021transfer abstract | |
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. | ||
| 520 | |a In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. | ||
| 650 | 7 | |a Lyapunov stability analysis |2 Elsevier | |
| 650 | 7 | |a Crossbar scheduling |2 Elsevier | |
| 650 | 7 | |a Input-queued switch |2 Elsevier | |
| 700 | 1 | |a Xu, Jun |4 oth | |
| 700 | 1 | |a Liu, Liang |4 oth | |
| 700 | 1 | |a Maguluri, Siva Theja |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |t Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand |d 2012transfer abstract |d an international journal |g Amsterdam [u.a.] |w (DE-627)ELV026258609 |
| 773 | 1 | 8 | |g volume:147 |g year:2021 |g pages:0 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.peva.2021.102197 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a GBV_ILN_72 | ||
| 951 | |a AR | ||
| 952 | |d 147 |j 2021 |h 0 | ||
| author_variant |
l g lg |
|---|---|
| matchkey_str |
gonglongxujunliuliangmagulurisivatheja:2021----:prcsefcietrtvsicigloihfr |
| hierarchy_sort_str |
2021transfer abstract |
| publishDate |
2021 |
| allfields |
10.1016/j.peva.2021.102197 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001628.pica (DE-627)ELV053386272 (ELSEVIER)S0166-5316(21)00014-6 DE-627 ger DE-627 rakwb eng 540 VZ Gong, Long verfasserin aut QPS-r: A cost-effective iterative switching algorithm for input-queued switches 2021transfer abstract nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. Lyapunov stability analysis Elsevier Crossbar scheduling Elsevier Input-queued switch Elsevier Xu, Jun oth Liu, Liang oth Maguluri, Siva Theja oth Enthalten in Elsevier Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand 2012transfer abstract an international journal Amsterdam [u.a.] (DE-627)ELV026258609 volume:147 year:2021 pages:0 https://doi.org/10.1016/j.peva.2021.102197 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_72 AR 147 2021 0 |
| spelling |
10.1016/j.peva.2021.102197 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001628.pica (DE-627)ELV053386272 (ELSEVIER)S0166-5316(21)00014-6 DE-627 ger DE-627 rakwb eng 540 VZ Gong, Long verfasserin aut QPS-r: A cost-effective iterative switching algorithm for input-queued switches 2021transfer abstract nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. Lyapunov stability analysis Elsevier Crossbar scheduling Elsevier Input-queued switch Elsevier Xu, Jun oth Liu, Liang oth Maguluri, Siva Theja oth Enthalten in Elsevier Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand 2012transfer abstract an international journal Amsterdam [u.a.] (DE-627)ELV026258609 volume:147 year:2021 pages:0 https://doi.org/10.1016/j.peva.2021.102197 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_72 AR 147 2021 0 |
| allfields_unstemmed |
10.1016/j.peva.2021.102197 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001628.pica (DE-627)ELV053386272 (ELSEVIER)S0166-5316(21)00014-6 DE-627 ger DE-627 rakwb eng 540 VZ Gong, Long verfasserin aut QPS-r: A cost-effective iterative switching algorithm for input-queued switches 2021transfer abstract nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. Lyapunov stability analysis Elsevier Crossbar scheduling Elsevier Input-queued switch Elsevier Xu, Jun oth Liu, Liang oth Maguluri, Siva Theja oth Enthalten in Elsevier Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand 2012transfer abstract an international journal Amsterdam [u.a.] (DE-627)ELV026258609 volume:147 year:2021 pages:0 https://doi.org/10.1016/j.peva.2021.102197 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_72 AR 147 2021 0 |
| allfieldsGer |
10.1016/j.peva.2021.102197 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001628.pica (DE-627)ELV053386272 (ELSEVIER)S0166-5316(21)00014-6 DE-627 ger DE-627 rakwb eng 540 VZ Gong, Long verfasserin aut QPS-r: A cost-effective iterative switching algorithm for input-queued switches 2021transfer abstract nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. Lyapunov stability analysis Elsevier Crossbar scheduling Elsevier Input-queued switch Elsevier Xu, Jun oth Liu, Liang oth Maguluri, Siva Theja oth Enthalten in Elsevier Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand 2012transfer abstract an international journal Amsterdam [u.a.] (DE-627)ELV026258609 volume:147 year:2021 pages:0 https://doi.org/10.1016/j.peva.2021.102197 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_72 AR 147 2021 0 |
| allfieldsSound |
10.1016/j.peva.2021.102197 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001628.pica (DE-627)ELV053386272 (ELSEVIER)S0166-5316(21)00014-6 DE-627 ger DE-627 rakwb eng 540 VZ Gong, Long verfasserin aut QPS-r: A cost-effective iterative switching algorithm for input-queued switches 2021transfer abstract nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. Lyapunov stability analysis Elsevier Crossbar scheduling Elsevier Input-queued switch Elsevier Xu, Jun oth Liu, Liang oth Maguluri, Siva Theja oth Enthalten in Elsevier Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand 2012transfer abstract an international journal Amsterdam [u.a.] (DE-627)ELV026258609 volume:147 year:2021 pages:0 https://doi.org/10.1016/j.peva.2021.102197 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_72 AR 147 2021 0 |
| language |
English |
| source |
Enthalten in Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand Amsterdam [u.a.] volume:147 year:2021 pages:0 |
| sourceStr |
Enthalten in Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand Amsterdam [u.a.] volume:147 year:2021 pages:0 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Lyapunov stability analysis Crossbar scheduling Input-queued switch |
| dewey-raw |
540 |
| isfreeaccess_bool |
false |
| container_title |
Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand |
| authorswithroles_txt_mv |
Gong, Long @@aut@@ Xu, Jun @@oth@@ Liu, Liang @@oth@@ Maguluri, Siva Theja @@oth@@ |
| publishDateDaySort_date |
2021-01-01T00:00:00Z |
| hierarchy_top_id |
ELV026258609 |
| dewey-sort |
3540 |
| id |
ELV053386272 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV053386272</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626034736.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">210910s2021 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.peva.2021.102197</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">/cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001628.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV053386272</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0166-5316(21)00014-6</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">540</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gong, Long</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">QPS-r: A cost-effective iterative switching algorithm for input-queued switches</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021transfer abstract</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Lyapunov stability analysis</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Crossbar scheduling</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Input-queued switch</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xu, Jun</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Liang</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Maguluri, Siva Theja</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="t">Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand</subfield><subfield code="d">2012transfer abstract</subfield><subfield code="d">an international journal</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV026258609</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:147</subfield><subfield code="g">year:2021</subfield><subfield code="g">pages:0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.peva.2021.102197</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_72</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">147</subfield><subfield code="j">2021</subfield><subfield code="h">0</subfield></datafield></record></collection>
|
| author |
Gong, Long |
| spellingShingle |
Gong, Long ddc 540 Elsevier Lyapunov stability analysis Elsevier Crossbar scheduling Elsevier Input-queued switch QPS-r: A cost-effective iterative switching algorithm for input-queued switches |
| authorStr |
Gong, Long |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV026258609 |
| format |
electronic Article |
| dewey-ones |
540 - Chemistry & allied sciences |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
540 VZ QPS-r: A cost-effective iterative switching algorithm for input-queued switches Lyapunov stability analysis Elsevier Crossbar scheduling Elsevier Input-queued switch Elsevier |
| topic |
ddc 540 Elsevier Lyapunov stability analysis Elsevier Crossbar scheduling Elsevier Input-queued switch |
| topic_unstemmed |
ddc 540 Elsevier Lyapunov stability analysis Elsevier Crossbar scheduling Elsevier Input-queued switch |
| topic_browse |
ddc 540 Elsevier Lyapunov stability analysis Elsevier Crossbar scheduling Elsevier Input-queued switch |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
j x jx l l ll s t m st stm |
| hierarchy_parent_title |
Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand |
| hierarchy_parent_id |
ELV026258609 |
| dewey-tens |
540 - Chemistry |
| hierarchy_top_title |
Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV026258609 |
| title |
QPS-r: A cost-effective iterative switching algorithm for input-queued switches |
| ctrlnum |
(DE-627)ELV053386272 (ELSEVIER)S0166-5316(21)00014-6 |
| title_full |
QPS-r: A cost-effective iterative switching algorithm for input-queued switches |
| author_sort |
Gong, Long |
| journal |
Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand |
| journalStr |
Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2021 |
| contenttype_str_mv |
zzz |
| container_start_page |
0 |
| author_browse |
Gong, Long |
| container_volume |
147 |
| class |
540 VZ |
| format_se |
Elektronische Aufsätze |
| author-letter |
Gong, Long |
| doi_str_mv |
10.1016/j.peva.2021.102197 |
| dewey-full |
540 |
| title_sort |
qps-r: a cost-effective iterative switching algorithm for input-queued switches |
| title_auth |
QPS-r: A cost-effective iterative switching algorithm for input-queued switches |
| abstract |
In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. |
| abstractGer |
In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. |
| abstract_unstemmed |
In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_72 |
| title_short |
QPS-r: A cost-effective iterative switching algorithm for input-queued switches |
| url |
https://doi.org/10.1016/j.peva.2021.102197 |
| remote_bool |
true |
| author2 |
Xu, Jun Liu, Liang Maguluri, Siva Theja |
| author2Str |
Xu, Jun Liu, Liang Maguluri, Siva Theja |
| ppnlink |
ELV026258609 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth |
| doi_str |
10.1016/j.peva.2021.102197 |
| up_date |
2024-07-06T18:48:34.992Z |
| _version_ |
1803856605340499968 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV053386272</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626034736.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">210910s2021 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.peva.2021.102197</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">/cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001628.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV053386272</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0166-5316(21)00014-6</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">540</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gong, Long</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">QPS-r: A cost-effective iterative switching algorithm for input-queued switches</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021transfer abstract</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing switching algorithms with very low computational complexity, that lead to high throughput and small delay is a challenging problem. There appears to be a fundamental tradeoff between the computational complexity of the switching algorithm and the resultant throughput and delay. Parallel maximal matching algorithms (adapted for switching) appear to have stricken a sweet spot in this tradeoff, and prior work has shown the following performance guarantees. Using maximal matchings in every time slot results in at least 50% switch throughput and order-optimal (i.e., independent of the switch size N ) average delay bounds for various traffic arrival processes. On the other hand, their computational complexity can be as low as O ( log 2 N ) per port/processor, which is much lower than those of the algorithms such as maximum weighted matching which ensures better throughput performance.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Lyapunov stability analysis</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Crossbar scheduling</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Input-queued switch</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xu, Jun</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Liang</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Maguluri, Siva Theja</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="t">Magnetic and spectroscopic characterizations of high-spin cobalt(II) complex with soft-scorpionate ligand</subfield><subfield code="d">2012transfer abstract</subfield><subfield code="d">an international journal</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV026258609</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:147</subfield><subfield code="g">year:2021</subfield><subfield code="g">pages:0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.peva.2021.102197</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_72</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">147</subfield><subfield code="j">2021</subfield><subfield code="h">0</subfield></datafield></record></collection>
|
| score |
7.40149 |