Abstract. In this paper, taking an algorithmic viewpoint, we explore the differences existing between the class of non real-time computing problems (R~) versus the class of real-time computing problems (~). We show how a problem in class RN can be transformed into its counterpart in class ~. Claims of real-time behavior made for solutions to problems in class ~ are examined. Ah example of a distributed computingproblem arising m class Is studmd, along with its solutmn. It is shown why off-line strategies or scheduling algorithms that are not driven by real-time/timeliness requirements ~ are incorrect for class ~. Finally, a unified approach to conceiving and measuring the efficiency of solutions to problems in classes R~ and ~ is proposed and illustrated with a few examples.
INTRODUCTIONOver the last 20 years, the distributed algorithms community has spent considerable effort solving problems in the areas of serializable or linearizable concurrent computing. These problems belong to a class denoted R~, the class of non reMtime computing problems. Separately, over the last 30 years, the real-time algorithms community has spent considerable effort solving scheduling problems in the area of centralized computing, considering preemptable and non-preemptable resources. Only recently has distributed computing received some attention. These problems belong to a class denoted ~, the class of real-time computing problems.In this paper, taking an algorithmic viewpoint, we embark on exploring the differences between both classes. The scope of this paper is restricted to that of deterministic algorithms. Besides intellectual interest, investigation of these issues is expected to bring the two communities closer, via the clarification of a few essential concepts. In particular, we have observed that the qualifiers "realtime" and "distributed" may not carry the same meaning in both communities. Broadly speaking, with few exceptions, the distributed algorithms community does not consider problem specifications that include real-time requirements. Conversely, the real-time algorithms community often fails to understand what is implied with considering a distributed computing problem.The remainder of this paper is organized as follows. In section 2, we introduce the distinctive attributes of class ~. In section 3, we examine claims of real-time