Analysis of threat based algorithm using different performance measures

¹ Department of Computer Science and Information Technology, University of Engineering and Technology, Peshawar, Pakistan
² Saarland University, Saarbrücken, Germany
³ Saarland Informatics Campus, Saarbrücken, Germany
⁴ School of Data Science and Computational Thinking, Stellenbosch University, Stellenbosch, South Africa

^* Corresponding author: ia@uetpeshawar.edu.pk

Received: 4 October 2016
Accepted: 7 August 2020

Abstract

Since its introduction in 1985, competitive analysis is a widely used tool for the performance measurement of online algorithms. Despite its simplicity and popularity, competitive analysis has its own set of drawbacks which lead to the development of other performance measures. However, these measures were seldom applied to problems in other domains. Recently Boyar et al. (Theor. Comput. Sci. 532 (2014) 2–13) studied the online search problem using various performance analysis measures for non-preemptive algorithms. We extend the work by considering preemptive threat-based algorithms and evaluate it using competitive analysis, bijective analysis, average case and relative interval analysis. For competitive analysis, and average case analysis, our findings are in contrast with that of Boyar et al., whereas for bijective and relative interval analysis our findings complement that of Boyar et al.