Research Center for Multiprocessor Systems Doctor Sergei Abramov. Supercomputers and multiprocessor software . Technologies for regional computer networks building . Functional programming , supercompilation and metacomputation theories , and their applications to practical programming . .
Related searches for Research Center for Multiprocessor Systems
The project has been completedin 4 months,cost per 1 TFlops (peak):under$700,000
SKIF К-1000:convenient components design,easily scalableup to 15 TFlops
RS-485 links:up to 125 nodes, up to 1,000 meters
Several links (equaling the number ofCOM-ports) may be connected tothe control station.
Head: Yury Shevchuk, Ph.D.
Functional programming, supercompilation and metacomputation theories, and their applications to practical programming
Thus, the methods are directed to provide degreesoffreedom for newsoftwaretechnologies rather than to optimizing programs written in an old style.
Let human be a program with two parameters knowledge and problem. Then creating a specialist humanknowledge from human and knowledge is a good example of specialization:
humanknowledge(problem) = human(knowledge,problem)
Specialist humanknowledge can solve problems much quicker than an ordinary human when the problems are covered by his specific knowledge.
<F x0, y>
The first argument of a program F is given, while the second is unknown.
<F <G x, y> , z >
Let two programs F and G be given, specialize a composition of
applications of the programs. That is specialization with respect to a
context of application.
<IntL ( Program ) e.data >
An interpreter IntL of a programming language L is specialized with
respect to a given program. IntL is written in a language M, while the
program is written in L, so we expect an optimal program written in M as
a result of specialization. Thus a specializer may be used as a compiler
from L into M, where M is the subject language of the specializer.
a functional programming language. The technique was introduced in the
1970s by V. F. Turchin. He proposed a task of creating tools to observe
operational semantics of a program, when a function F that is to be computed by the program is fixed. As a result of such observations a new algorithmic definition of an extension of the function F must be constructed. His ideas were studied by a number of authors for a long time.
parameterized application of a program uniformly on the parameters as
<IntL ( Program ) e.data >
An interpreter IntL of a programming language L is specialized with respect to a given program. IntL is written in a language M, while the program is written in L, so we expect an optimal program written in M as a result of specialization.
Thus a specializer may be used as a compiler from L into M, where M is the subject language of the specializer.
Semantics modifiers (a class of programs that allow the development of general and reusable “semantics components”) can be specialized alike interpreters.
 Abramov S.M., and Glueck R. From standard to non-standard semantics by semantics
modifiers. International Journal of Foundation of Computer Science, Vol. 12 No. 2,
 Nemytykh A.P., and Turchin V.F. The Supercompiler Scp4: sources, on-line
demonstration. http://www.botik.ru/pub/local/scp/refal5/ ,2000.
 Nemytykh A.P., The Supercompiler Scp4: General Structure., LNCS vol. 2890,
 Nemytykh A.P., A Note on Elimination of Simplest Recursions. In Proceedings of
the ACM SIGPLAN Asia-PEPM'02, 138-146. ACM Press, 2002.
 Korlyukov A.V., and Nemytykh A.P., Supercompilation of Double Interpretation.
(How One Hour of the Machine's Time Can Be Turned to One Second). (In English),
Vestnik natcional’nogo tekhnicheskogo universiteta “Khar’kovskogo politekhnicheskogo
instituta”, Khar’kov, No. 1, 2004.
 Lisitsa A., and Nemytykh A.P., Verification via Supercompilation.
http://www.csc.liv.ac.uk/~alexei/VeriSuper/ , 2005.