My photo
         

      Anna S. Nepomniaschaya

Supercomputer Software Department
Institute of Computational Mathematics and Mathematical Geophysics
(until 01 Sep 1997 - Computing Center)
Russian Academy of Sciences, Siberian Branch

Senior Research Scientist

[Official Information] [Education] [Research] [Projects] [Publications]


Official information

Full name:    Anna Shmilevna Nepomniaschaya
Address (work):   prospect ac. Lavrentieva, 6, Novosibirsk, 630090, Russia
Telephone (office):  (3832) 343 994
Telephone (home):  (3832) 322 468
Fax:  (007) (3832) 324 259
E-mail:  anep@ssd2.sscc.ru


Education

1981 Ph.D., Computer Science, Novosibirsk Computer Center,
Siberian Division, USSR Academy of Sciences.
1967 M.S. Mathematics, with Honors, Chernovtsy State University.


Present subjects of research

Current interests are in studying associative parallel algorithms on graphs by means of vertical processing systems. Such an architecture belongs to fine--grained systems with bit--serial (or vertical) processing and simple single-bit processing elements. These systems provide very high performance due to concurrent run of a large number of PEs. They are well suited to solving graph theoretical problems.

Main results include:


Current projects


Main publications

(74 papers have been published in automata theory, theory of formal grammars and languages, theory of parallel algorithms and parallel processing.)
  1. Very-High-Level Language PARIS (with V.\,D.\,Korneev, N.\,N.\,Mirenkov). In: Proc. of the Intern. Conf. ``Parallel Computing Technologies", (World Scientific, Singapure) (1991) 186--194.
  2. Language STAR for Associative and Parallel Computation with Vertical Data Processing. In: Proc. of the Intern. Conf. ``Parallel Computing Technologies", (World Scientific, Singapure) (1991) 258--265.
  3. Application of specialized processors for effective realization of relational algebra operations in vertical processing systems (with Y.I.Fet). In: Cybernetics and System Analysis, (1993), No.2, 85--94 (in Russian).
  4. Investigation of associative search algorithms in vertical processing systems. In: Proc. of the Intern. Conf. "Parallel Computing Technologies", (part 3), Obninsk, Russia, (1993), 631--642.
  5. Modelling of an Associative Parallel Processor Run (Description of a Language and its Translator), (with V.J.Tskhay). In: Teoria i sistemi upravlenia, (Izvestia Akademii nauk, Moscow), (1995), No.3, 154--159 (in Russian).
  6. Optimization of representing an algorithm for finding a minimal spanning tree on associative parallel processors. In: Cybernetics and System Analysis}, (1995), No.4, 3--13 (in Russian).
  7. Investigation of Some Hardware Accelerators for Relational Algebra Operations (with Y.I.Fet). In: IEEE, Proceedings of the First Aizu Intern. Symp. on Parallel Algorithms/Architectures Synthesis, Japan, (1995), 308--314.
  8. Comparison of two MST Algorithms for Associative Parallel Processors. In: Proc. of the 3-d Intern. Conf. "Parallel Computing Technologies", PaCT--95, (St. Petersburg, Russia), Lecture Notes in Computer Science, {\bf 964}, (1995) 85--93.
  9. Representation of the Gabow Algorithm for Finding Smallest Spanning Trees with a Degree Constraint on Associative Parallel Processors. In: Euro--Par'96 Parallel Processing. Second Intern. Euro--Par Conf. Lyon, France. Proceedings, Lect. Notes in Comp. Sci., (Springer--Verlag, Berlin, 1996), v.1123, 813--817.
  10. An Associative Version of the Prim--Dijkstra Algorithm and its Application to Some Graph Problems. In: Andrei Ershov Second Intern. Memorial Conf. ``Perspectives of System Informatics", Lecture Notes in Computer Science, v. 1181, (Berlin: Springer--Verlag,1996) 203--213.
  11. Representations of the Prim--Dijkstra Algorithm on Associative Parallel Processors. In: Proc. of VII Intern. Workshop on Parallel Processing by Cellular Automata and Arrays. Parcella'96, (Academie Verlag, Berlin, 1996) 184--194.
  12. Comparison of models for associative parallel computations (with M.A.Vladyko). In: Programming, Moskow, (1997), No.6, 41-50 (in Russian). (English translation by Plenum Press, USA).
  13. Solution of Path Problems Using Associative Parallel Processors In: Proceedings of the International Conference on Parallel and Distributed Systems, (IEEE Computer Society Press), ICPADS'97, December 10--13, (1997), Korea, Seoul, 610--617.
  14. Effective Representation of Some Graph Problems on Associative Parallel Processors. In: Proceedings of the Twelfth International Symposium on Computer and Information Sciences, (Bogazici University Printhouse), ISCIS XII, October 27--29, (1997), Antalya, Turkey, 430--437.
  15. An Efficient Associative Algorithm for Finding the Smallest Spanning Tree with a Degree Constrained. In: Cybernetics and System Analysis, Kiev, (1998), No.1, 94--103 (in Russian). (English translation by Plenum Press, USA).
  16. A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors. (together with Dvoskina M.A.) In: Proceedings of the Concurrency, Specification and Programming Workshop, Warsaw, Poland, September 28-30, (1999), 141--152.


This page last updated on Jan 25, 2000.