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
The complexity of systolic dissemination of information in interconnection networks
1994
RAIRO - Theoretical Informatics and Applications
Preserved Fulltext
For systolic algorithms in two-way (téléphone) communication mode, the optimal gossip algorithm for paths is in fact a 2-systolic communication algorithm. ...
In each period, the systolic one-way gossip algorithm perforais a complete gossip in each block Bi for all 1 ^ i ^ (n -l)/(fc -2). ...
Which time can be achieved by a [2 k + 2]-systolic one way gossip algorithm? (An upper bound of 3 kh -(k -1) can easily be obtained for [2 k -f 2]-systolic gossiping.) ...
doi:10.1051/ita/1994283-403031
fatcat:orimdy2pkbhz3kewdqask43cqi
Page 4340 of Mathematical Reviews Vol. , Issue 96g
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Optimal systolic gossip algorithms for complete k-ary trees, in both one-way and two-way communication modes, are described. Finally, in the conclusion, the authors point out two unsolved problems. ...
A general relation between systolic broadcast and systolic gossip is obtained. ...
Page 6379 of Mathematical Reviews Vol. , Issue 99i
[page]
1999
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(SK-K MSKM; Bratislava) ;
Wagener, Hubert (D-MAG-CS; Magdeburg)
Effective systolic algorithms for gossiping in cycles. ...
A k-systolic communication algorithm involves a number of iterations of a sequence of k communication steps or rounds. ...
A generic theoretical framework for modeling gossip-based algorithms
2007
ACM SIGOPS Operating Systems 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 2008; you can also visit the original URL.
The file type is application/pdf.
Acknowledgments The authors would like to thank Michel Raynal and Vivek Rai for useful discussions and contributions to the contents of this paper. ...
, and topology management [15] . tributed algorithms, in which nodes take steps and exchange information in execution cycles in order to provide a solution to given problems in a distributed manner. ...
CONCLUSION AND FUTURE WORK In this paper we have presented a generic framework for theoretical analysis of gossip-based algorithms. ...
doi:10.1145/1317379.1317384
fatcat:ri44omfvlzeh5pnpgs2nyoydne
Page 472 of Mathematical Reviews Vol. , Issue 98A
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
systolic algorithms for gossiping in cycles and two-dimensional grids (ex- tended abstract) (273-282); Petr Janéar, Frantisek Mraz, Martin Platek and Jérg Vogel, Restarting automata (283-292). ...
Zaroliagis, Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs (191-200); Feodor F. ...
Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet
[chapter]
2005
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 2005; you can also visit the original URL.
The file type is application/pdf.
The CCOF cycle sharing system encompasses all activities involved in the management of idle cycles: overlay construction for hosts donating cycles, resource discovery within the overlay, application-based ...
Our system, Cluster Computing on the Fly, seeks to harvest cycles from ordinary users in an open access, non-institutional environment. ...
Another approach is a fully distributed protocol that uses gossiping in a tournament-style backoff algorithm. Initially, each node says hello to its k-hop neighbors. ...
doi:10.1007/978-3-540-30183-7_22
fatcat:qa3wgnxft5g3lac4hmj2fa2wgi
Wireless Body Area Networks for Healthcare: A Survey
2012
International Journal of Ad Hoc, Sensor and Ubiquitous Computing
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 2012; you can also visit the original URL.
The file type is application/pdf.
Wireless body area networks (WBANs) are emerging as important networks, applicable in various fields. This paper surveys the WBANs that are designed for applications in healthcare. ...
BP varies between a maximum (systolic) and a minimum (diastolic) pressure during a cardiac cycle. ...
Each node informs its children about their turns for sending data. Data transfer takes place as a sequence of cycles: a control cycle and a data cycle. ...
doi:10.5121/ijasuc.2012.3301
fatcat:usjxjojpbrfsjgnupevgu2mgh4
Subject index volumes 1–200
1999
Theoretical 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.
-, 613
generating
self-affine fractals, 2728
series, 1473, 1480, 2948, 3141
set, 2539
sets, 173
sequences of functions, method of -, I21
generating shift-register cycles, 866
algorithm for -, ...
in
group automata, 1494
L systems, 489, 573
stability of
biological schemes, 32
sorting, 11
systolic automata, 1069
stability
property for sorting, 11
order-theoretic characterization
of -., ...
doi:10.1016/s0304-3975(98)00319-3
fatcat:s22ud3iiqjht7lfbtc3zctk7zm
Reference list of indexed articles
2000
Discrete Applied Mathematics
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.
Schaefer, An optimal algorithm for finding dominating cycles in circular-arc graphs 36 ( 1992) 25-34 876. M. ...
Hell, Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs (Note) 41 (93) 75-79 992. K. Culik and S. ...
doi:10.1016/s0166-218x(00)00209-2
fatcat:l53yxlj45ffdrdecl3uah2gj3y
A Survey on Distributed Machine Learning
2020
ACM Computing Surveys
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 2021; you can also visit the original URL.
The file type is application/pdf.
The most important component of the TPU is its Matrix Multiply unit based on a systolic array. ...
For example, Meuth [100] reported a speed-up up to 200× over conventional CPUs for an image recognition algorithm using a Pretrained Multilayer Perceptron (MLP). ...
Every effective ML algorithm needs a method that forces the algorithm to improve itself based on new input data so it can improve its accuracy. ...
doi:10.1145/3377454
fatcat:apwpdtza4zc2tcn37hnxxrb74u
Psychological response styles and cardiovascular health: Confound or independent risk factor?
2000
Health Psychology
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.
Higher self-deception scores predicted elevated 3-year diastolic and systolic blood pressure means in study 1, and poorer treatment outcomes in study 2. ...
Results most strongly supported the main effects model. ...
With a means of accurate measurement in place, the development of algorithms meant to correct for these influences was a logical next step. ...
doi:10.1037//0278-6133.19.5.441
pmid:11007152
fatcat:x33hcgjexffbxjvovhhapp5xmq
Parallel computer vision on a reconfigurable multiprocessor network
1997
IEEE Transactions on Parallel and Distributed 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 2017; you can also visit the original URL.
The file type is application/pdf.
Timing results for typical low-and intermediate-level vision algorithms on a transputerbased prototype are presented. ...
The reconfigurability of the architecture is shown to result in a low network diameter and also a low degree of connectivity for each node in the network. ...
Sarmad Abbasi for his comments and discussions on some of the algorithms and the proofs of some of the theorems in this paper. ...
doi:10.1109/71.584095
fatcat:o7q2qhadlzaljiu4ehukq3fw7y
Page 1578 of Mathematical Reviews Vol. 31, Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(English summary) 99g:68017
Hromkovié, Juraj (with Klasing, Ralf; Pardubska, Dana; Waczulik, Juraj; Wagener, Hubert) Effective systolic algorithms for gossiping in cycles. ...
English and Chinese summaries) 99g:68016
— (with Jia, Hong) The problem of embedding cycles into crossed cubes and an algorithm for it. (Chinese. ...
Subject index volumes 1–92
2000
Discrete Applied Mathematics
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.
, 1919 list, 1745 mechanism, 1988 2% 1431,984, 1441, 1446, 1693, 2048, 2106 algorithm, 2048, 2106 complexity, 2106 problem, 276, 1434 scheme, 204, 1431 gossiping, 1431, 1434, 1442, 1446, 1540, 1567 ...
matroid, 99
edge, 2238
matroid, 1609
unquad cycle, 17 18
unrank, 1946
unranking algorithm, 878
unreliable message, 1431
unrestricted
minimal lattice path, 793
steps, 2258
unsatisfiability, ...
, 373, 640, 2040 reduction, 77,88,219,232,435,481,491,562, 586, 688,736,863,1007 . 1034 ,1115 ,1160 , 1161 , 1387 , 1545 , 1563 , 1745 , 1768 , 1797 , 1988 , 1990 , 1995 ,2 167,22 IO, 2223 algorithm, 711 ...
doi:10.1016/s0166-218x(00)00208-0
fatcat:3e5dfhyphbbchjttvqq4yalo7e
Page 1855 of Mathematical Reviews Vol. 31, Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Jones) 99i:11049 11G40 (11G05, 14G10)
Waczulik, Juraj (with Hromkovié, Juraj; Klasing, Ralf; Pardubska, Dana; Wagener, Hubert) Effective systolic algorithms for gossiping in cycles. ...
(Summary) 99k:90108 90C10 (68Q25, 90C60)
Wagener, Hubert (with Hromkovié, Juraj; Klasing, Ralf; Pardubska, Dana; Waczulik, Juraj) Effective systolic algorithms for gossiping in cycles. ...
« Previous
Showing results 1 — 15 out of 42 results