Distributed Computing in Algebraic Topology: first trials
نویسندگان
چکیده
Nowadays, Internet appears as a suitable tool for performing scientific computations in a distributed collaborative way. One of the fields where this idea can be applied is that of Symbolic Computation. Computer Algebra packages are being extended to interconnect them. In fact, some Computer Algebra systems are already capable of performing distributed computing. An example is Distributed Maple [7], which is an environment for executing parallel computer algebra programs on multiprocessors and heterogeneous clusters. With this example in mind, it is clear that this trend could be explored in any other Symbolic Computation system, in particular in systems devoted to algorithmic Algebraic Topology. The leader systems in this field are EAT [3] and Kenzo [4]. These systems, created by Sergeraert, can be used to compute homology groups of infinite topological spaces, namely loop spaces. Both systems are written in the Common Lisp programming language and have obtained some results (specifically, homology groups) which had never been determined before using neither theoretical nor computational methods. Since the programs are very time (and space) consuming, it is obvious that they are specially well placed to try making them distributed. EAT and Kenzo are written in the Common Lisp programming language, but Java is the core language in the net-centric mainstream technology. That is the reason why we first thought of reconstructing the systems in the Java language. As an intermediate step, we rebuilt (some fragments of) EAT in the statically typed functional programming language ML [6]. Thus, we have implemented two prototypes to perform computations in Algebraic Topology in ML and Java respectively. The following step we undertook was to interoperate between these systems through the net. Our first attempt was to use MathML (Mathematical Markup Language) [5] (an XML dialect which was the first standard to represent mathematics) as exchange language, but it turned out to be not adequate as the elements of the algebraic structures that EAT
منابع مشابه
Conference on Algebraic Topological Methods in Computer Science
The recognition that within the area of computational geometry, the methods of algebraic topology can provide qualitative and shape information which isn't available from other methods. Algebraic topology provides a tool for visualization and feature identification in high dimensional data. Algebraic topology is an extremely useful framework for analyzing problems in distributed computing, such...
متن کاملOn the role of distributed computing in Symbolic Computation for Algebraic Topology
In this work, we report on the preliminary analysis carried out in order to undertake the task of designing and building distributed systems for Symbolic Computation in Algebraic Topology. We try to make explicit how the peculiarities of the programs computing homology and homotopy groups can influence on the development of distributed systems to perform the same calculations. We stress not onl...
متن کاملRemote Access to a Symbolic Computation System for Algebraic Topology: A Client-Server Approach
Kenzo is a Symbolic Computation system created by Sergeraert for computing in Algebraic Topology. It is programmed in Common Lisp and this programming language also acts as user interface. In this paper, a prototype to provide remote access for Kenzo is presented. This has been accomplished by using Corba technology: clients have been developed both in Java and Common Lisp (the server is always...
متن کاملSurvey on Topological Methods in Distributed Computing
One of the most exciting developments in the theory of distributed computing in recent years has been the application of powerful concepts from topology to prove results about computability in resilient distributed systems. Topology is a branch of mathematics that deals with connectivity and convergence of certain types of objects. As it turns out, the higher dimensional connectivity properties...
متن کاملAlgebraic spans
Topological methods have yielded a variety of lower bounds and impossibility results for distributed computing. In this paper, we introduce a new tool for proving impossibility results, based on a core theorem of algebraic topology, the acyclic carrier theorem, which uniies, generalizes, and extends earlier results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004