( en | de | ru )

 

Disambiguation of "Kanevsky, Arkady"

Author of the publication

copydeleteadd this publication to your clipboard
A generalized utilization bound test for fixed-priority real-time scheduling.

, , , and . RTCSA, page 73-. IEEE Computer Society, (1995)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Arkady Pikovsky

 

Other publications of authors with the same name

Enhanced Remote Direct Memory Access (RDMA) Connection Establishment., , , and . RFC, (April 2012)The Real-Time Message Passing Interface Standard (MPI/RT-1.1) ., , , , , , , , , and . Concurr. Pract. Exp., 16 (S1): 0-322 (2004)A Note on Approximating Graph Genus., , and . Inf. Process. Lett., 61 (6): 317-322 (1997)On the Complexities of the Leader Election Algorithms., and . ICCI, page 202-206. IEEE Computer Society, (1993)Improved Algorithms for Graph Four-Connectivity, and . FOCS, page 252-259. IEEE Computer Society, (1987)Are Disks the Dominant Contributor for Storage Failures? A Comprehensive Study of Storage Subsystem Failure Characteristics., , , and . FAST, page 111-125. USENIX, (2008)On Assembly of Four-Connected Graphs (Extended Abstract)., and . WG, volume 657 of Lecture Notes in Computer Science, page 158-169. Springer, (1992)Storage System Problem Troubleshooting andSystem Logs., , , , and . login Usenix Mag., (2009)Understanding Customer Problem Troubleshooting from Storage System Logs., , , , , and . FAST, page 43-56. USENIX, (2009)Vertex Connectivity of Graphs: Algorithms and Bounds. University of Illinois Urbana-Champaign, USA, (1988)