Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Electrical and Computer Engineering Faculty Publications

Series

Performance evaluation

Articles 1 - 2 of 2

Full-Text Articles in Computer Engineering

End-To-End Latency Of A Fault-Tolerant Corba Infrastructure, Wenbing Zhao, Louise E. Moser, P. Michale Melliar-Smith May 2006

End-To-End Latency Of A Fault-Tolerant Corba Infrastructure, Wenbing Zhao, Louise E. Moser, P. Michale Melliar-Smith

Electrical and Computer Engineering Faculty Publications

This paper presents an evaluation of the end-to-end latency of a fault-tolerant CORBA infrastructure that we have implemented. The fault-tolerant infrastructure replicates the server applications using active, passive and semi-active replication, and maintains strong replica consistency of the server replicas. By analyses and by measurements of the running fault-tolerant infrastructure, we characterize the end-to-end latency under fault-free conditions. The main determining factor of the run-time performance of the fault-tolerant infrastructure is the Totem group communication protocol, which contributes to the end-to-end latency primarily in …


Isomorphic Strategy For Processor Allocation In K-Ary N-Cube Systems, Moonsoo Kang, Chansu Yu, Hee Yong Youn, Ben Lee, Myungchul Kim May 2003

Isomorphic Strategy For Processor Allocation In K-Ary N-Cube Systems, Moonsoo Kang, Chansu Yu, Hee Yong Youn, Ben Lee, Myungchul Kim

Electrical and Computer Engineering Faculty Publications

Due to its topological generality and flexibility, the k-ary n-cube architecture has been actively researched for various applications. However, the processor allocation problem has not been adequately addressed for the k-ary n-cube architecture, even though it has been studied extensively for hypercubes and meshes. The earlier k-ary n-cube allocation schemes based on conventional slice partitioning suffer from internal fragmentation of processors. In contrast, algorithms based on job-based partitioning alleviate the fragmentation problem but require higher time complexity. This paper proposes a new allocation scheme based on isomorphic partitioning, where the processor space is partitioned into higher dimensional isomorphic subcubes. The …