A batch scheduler with high level components

In this article we present the design choices and the evaluation of a batch scheduler for large clusters, named OAR. This batch scheduler is based upon an original design that emphasizes on low software complexity by using high level tools. The global architecture is built upon the scripting language Perl and the relational database engine Mysql. The goal of the project OAR is to prove that it is possible today to build a complex system for ressource management using such tools without sacrificing efficiency and scalability. Currently, our system offers most of the important features implemented by other batch schedulers such as priority scheduling (by queues), reservations, backfilling and some global computing support. Despite the use of high level tools, our experiments show that our system has performances close to other systems. Furthermore, OAR is currently exploited for the management of 700 nodes (a metropolitan GRID) and has shown good efficiency and robustness

On the Nash points of subanalytic sets

Based on a recently developed rank Theorem for Eisenstein power series, we provide new proofs of the following two results of W. Pawlucki: I) The non regular locus of a complex or real analytic map is an analytic set. II) The set of semianalytic or Nash points of a subanalytic set X is a subanalytic set, whose complement has codimension two in X.Comment: Important: Our original pre-print arXiv:2205.03079 had two set of distinct results. We have divided that pre-print in two. This paper contains the second set of results ; v2 of the original submission contains the first set of results. We have divided our pre-prin