Relativistic Causality and Clockless Circuits

被引:1
作者
Matherat, Philippe [1 ]
Jaekel, Marc-Thierry [2 ,3 ]
机构
[1] CNRS LTCI UMR 5141, Paris, France
[2] Univ Paris 06, F-75252 Paris 05, France
[3] Ecole Normale Super, CNRS LPTENS UMR 8549, F-75231 Paris, France
关键词
Design; Experimentation; Languages; Performance; Theory; Asynchronous circuits and systems; causality; clockless circuits; delay-insensitive; distributed processing; models of time; partial time-order; physical time; relativity; trace theory; TIME;
D O I
10.1145/2043643.2043650
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Time plays a crucial role in the performance of computing systems. The accurate modelling of logical devices, and of their physical implementations, requires an appropriate representation of time and of all properties that depend on this notion. The need for a proper model, particularly acute in the design of clockless delay-insensitive (DI) circuits, leads one to reconsider the classical descriptions of time and of the resulting order and causal relations satisfied by logical operations. This questioning meets the criticisms of classical spacetime formulated by Einstein when founding relativity theory and is answered by relativistic conceptions of time and causality. Applying this approach to clockless circuits and considering the trace formalism, we rewrite Udding's rules, which characterize communications between DI components. We exhibit their intrinsic relation with relativistic causality. For that purpose, we introduce relativistic generalizations of traces, called R-traces, which provide a pertinent description of communications and compositions of DI components.
引用
收藏
页数:19
相关论文
共 26 条
[1]  
[Anonymous], 1989, The Collected Papers of Albert Einstein
[2]  
Chu T., 1985, Proceedings of IEEE International Conference on Computer Design: VLSI in Computers. ICCD '85 (Cat. No.85CH2223-6), P407
[3]   A FORMAL APPROACH TO DESIGNING DELAY-INSENSITIVE CIRCUITS [J].
EBERGEN, JC .
DISTRIBUTED COMPUTING, 1991, 5 (03) :107-119
[4]  
EBERGEN JC, 1987, THESIS TU EINDHOVEN
[5]  
Einstein A, 1905, ANN PHYS-BERLIN, V17, P891
[6]   COMMUNICATING SEQUENTIAL PROCESSES [J].
HOARE, CAR .
COMMUNICATIONS OF THE ACM, 1978, 21 (08) :666-677
[7]   TIME, CLOCKS, AND ORDERING OF EVENTS IN A DISTRIBUTED SYSTEM [J].
LAMPORT, L .
COMMUNICATIONS OF THE ACM, 1978, 21 (07) :558-565
[8]   ON INTERPROCESS COMMUNICATION .1. BASIC FORMALISM [J].
LAMPORT, L .
DISTRIBUTED COMPUTING, 1986, 1 (02) :77-85
[9]  
Matherat P., 2003, Mathematical Structures in Computer Science, V13, P771, DOI 10.1017/S0960129503004067
[10]  
MATTERN F, 1992, PARALLEL DISTRIBUTED, P215