Search

When compared to blocking concurrency, non-blocking concurrency can provide higher performance in parallel shared-memory contexts, especially in high contention scenarios. This paper proposes FLeeC, an application-level cache system based on Memcached, which leverages re-designed data structures and non-blocking (or lock-free) concurrency to improve performance by allowing any number of concurrent writes and reads to its main data structures, even in high-contention scenarios. We discuss and evaluate its new algorithms, which allow a lock-free eviction policy and lock-free fast lookups. FLeeC can be used as a plug-in replacement for the original Memcached, and its new algorithms and concurrency control strategies result in considerable performance improvements (up to 6x)., Comment: In INForum 2023 - Atas do 14 Simposio de Informatica, INForum, Porto, Portugal

We extend the ramified geometric Satake equivalence due to Zhu (for tamely ramified groups) and the third named author (in full generality) from rational coefficients to include modular and integral coefficients., Comment: 79 pages

We derive a Serre presentation of distribution algebras of loop groups in characteristic $p$ and apply it to give a new proof of the normality of Schubert varieties inside parahoric affine Grassmannians, for all connected reductive groups whose fundamental group is $p$-torsion free., Comment: 22 pages

We show that the nearby cycles functor for the $p$-adic Hecke stack at parahoric level is perverse t-exact, by developing a theory of Wakimoto filtrations at Iwahori level, and that it lifts to the $\mathbb{E}_1$-center. We apply these tools to construct the Arkhipov-Bezrukavnikov functor for $p$-adic affine flag varieties at Iwahori level, and prove that it is an equivalence for type $A$ groups., Comment: 53 pages, added missing funding reference

Application of soft and compliant joints in grasping mechanisms received an increasing attention during recent years. This article suggests the design and development of a novel bio-inspired compliant finger which is composed of a 3D printed rigid endoskeleton covered by a soft matter. The overall integrated system resembles a biological structure in which a finger presents an anthropomorphic look. The mechanical properties of such structure are enhanced through optimization of the repetitive geometrical structures that constructs a flexure bearing as a joint for the fingers. The endoskeleton is formed by additive manufacturing of such geometries with rigid materials. The geometry of the endoskeleton was studied by finite element analysis (FEA) to obtain the desired properties: high stiffness against lateral deflection and twisting, and low stiffness in the desired bending axis of the fingers. Results are validated by experimental analysis.

Recent research has proposed different approaches on the automated identification of candidate microservices on monolith systems, which vary on the monolith representation, similarity criteria, and quality metrics used. On the other hand, they are generally limited in the number of codebases and decompositions evaluated, and few comparisons between approaches exist. Considering the emerging trend in software engineering in techniques based on the analysis of codebases' evolution, we compare a representation based on the monolith code structure, in particular the sequences of accesses to domain entities, with representations based on the monolith development history (file changes and changes authorship). From the analysis on a total of 468k decompositions of 28 codebases, using five quality metrics that evaluate modularity, minimization of the number of transactions per functionality, and reduction of teams and communication, we conclude that the best decompositions on each metric were made by combining data from the sequences of accesses and the development history representations. We also found that the changes authorship representation of codebases with many authors achieves comparable or better results than the sequence of accesses representation of codebases with few authors with respect to minimization of the number of transactions per functionality and the reduction of teams., Comment: 11 pages, 6 figures

In this paper we determine the scheme-theoretic fixed points of pinned reductive group schemes acted upon by a group of pinning-preserving automorphisms. The results are used in a companion paper to establish a ramified geometric Satake equivalence with integral or modular coefficients., Comment: Comments welcome!

We prove that all $p$-adic period domains (and their non-minuscule analogues) are geometrically connected. This answers a question of Hartl [Har13] and has interesting consequences to the geometry of Shimura and local Shimura varieties., Comment: Fixed proof of Lemma 3.3 and improved the introduction

We construct local models of Shimura varieties and investigate their singularities, with special emphasis on wildly ramified cases. More precisely, with the exception of odd unitary groups in residue characteristic $2$ we construct local models, show reducedness of their special fiber, Cohen$-$Macaulayness and in equi-characteristic also (pseudo-)rationality. In mixed characteristic we conjecture their (pseudo-)rationality. This is based on the construction of parahoric group schemes over two-dimensional bases for wildly ramified groups and an analysis of singularities of the attached Schubert varieties in positive characteristic using perfect geometry., Comment: 37 pages. Final version accepted to Math. Ann

We present a model of leptonic mixing based on two $A_5$ modular symmetries using the Weinberg operator. The two modular symmetries are broken to the respective diagonal $A_5$ subgroup. At the effective level, the model behaves as a model with a single $A_5$ modular flavour symmetry, but with two moduli. Using both as stabilisers, different residual symmetries are preserved, leading to golden ratio mixing that is perturbed by a rotation., Comment: 20 pages, 2 figures. arXiv admin note: substantial text overlap with arXiv:2107.04042

We show that the v-sheaf local models of moduli spaces of $p$-adic shtukas are unibranch. In particular, this proves that the scheme-theoretic local models defined in our joint work with Ansch\"{u}tz and Richarz are always normal with reduced special fiber, thereby establishing the remaining cases of the geometric part of the Scholze$-$Weinstein conjecture when $p \leq 3$. Our methods are general, topological, and simplify Zhu's proof of the coherence conjecture. As a technical input, we generalize a comparison theorem of nearby cycles of Huber to the v-sheaf setup., Comment: 13 pages

We prove the Scholze--Weinstein conjecture on the existence and uniqueness of local models of local Shimura varieties and the test function conjecture of Haines--Kottwitz in this setting. In order to achieve this, we establish the specialization principle for well-behaved $p$-adic kimberlites, show that these include the v-sheaf local models, determine their special fibers using hyperbolic localization for the \'etale cohomology of small v-stacks and analyze the resulting specialization morphism using convolution., Comment: Comments welcome!

In this work, we introduce an optoelectronic spiking artificial neuron capable of operating at ultrafast rates ($\approx$ 100 ps/optical spike) and with low energy consumption ($<$ pJ/spike). The proposed system combines an excitable resonant tunnelling diode (RTD) element exhibiting negative differential conductance, coupled to a nanoscale light source (forming a master node) or a photodetector (forming a receiver node). We study numerically the spiking dynamical responses and information propagation functionality of an interconnected master-receiver RTD node system. Using the key functionality of pulse thresholding and integration, we utilize a single node to classify sequential pulse patterns and perform convolutional functionality for image feature (edge) recognition. We also demonstrate an optically-interconnected spiking neural network model for processing of spatiotemporal data at over 10 Gbps with high inference accuracy. Finally, we demonstrate an off-chip supervised learning approach utilizing spike-timing dependent plasticity for the RTD-enabled photonic spiking neural network. These results demonstrate the potential and viability of RTD spiking nodes for low footprint, low energy, high-speed optoelectronic realization of neuromorphic hardware., Comment: Updated with feedback from first round of reviews. Updated figure with 3D model

We construct lepton flavour models based on two $A_4$ modular symmetries. The two $A_4$ are broken by a bi-triplet field to the diagonal $A_4$ subgroup, resulting in an effective modular $A_4$ flavour symmetry with two moduli. We employ these moduli as stabilisers, that preserve distinct residual symmetries, enabling us to obtain Tri-Maximal 2 (TM2) mixing with a minimal field content (without flavons)., Comment: 17 pages, 2 figures. v2: version accepted in NPB

The concurrency control algorithms in transactional systems limits concurrency to provide strong semantics, which leads to poor performance under high contention. As a consequence, many transactional systems eschew strong semantics to achieve acceptable performance. We show that by leveraging semantic information associated with the transactional programs to increase concurrency, it is possible to significantly improve performance while maintaining linearizability. To this end, we introduce the lazy state determination API to easily expose the semantics of application transactions to the database, and propose new optimistic and pessimistic concurrency control algorithms that leverage this information to safely increase concurrency in the presence of contention. Our evaluation shows that our approach can achieve up to 5x more throughput with 1.5c less latency than standard techniques in the popular TPC-C benchmark.

We extend (scheme-theoretic) Bruhat-Tits theory to quasi-reductive groups i.e. with trivial split unipotent radical over discretely valued henselian non-archimedean fields $K$, whose ring of integers is excellent and residue field is perfect, building on Bruhat-Tits I et II and the classification of pseudo-reductive groups by Conrad-Gabber-Prasad. The buildings had been constructed previously by Solleveld in a different manner, but they ultimately coincide with ours. We were motivated by the geometry of affine Grassmannians and give some applications at the end (compare also with previously submitted work arXiv:1912.11918)., Comment: 32 pages, in French, text overlap in 2.8 with arXiv:1912.11918, to appear in JIMJ

We extend the work of Pappas-Rapoport-Zhu on twisted affine Grassmannians to wildly ramified, quasi-split, and residually split groups, assuming the maximal torus is induced. This relies on the construction, inspired by Tits, of certain smooth, affine, and connected $\mathbb{Z}[t]$-groups of parahoric type, which should be regarded as $\mathbb{Z}$-families of parahoric group schemes, and naturally extends a similar construction in the above articles after inverting $e$. The resulting $\mathbb{F}_p(t)$-groups are pseudo-reductive possibly non-standard in the sense of Conrad--Gabber--Prasad, and their $\mathbb{F}_p[[t]]$-models are parahoric in our generalized sense. We study their affine Grassmannians, establishing normality of Schubert varieties and Zhu's coherence theorem., Comment: 82 pages, in French. The paper was almost completely rewritten and now treats non reduced root systems as well. Applications to the Scholze-Weinstein conjecture on local models were left out for future work

This report presents the activities of the first working group of the COST Action ArVI, Runtime Verification beyond Monitoring. The report aims to provide an overview of some of the major core aspects involved in Runtime Verification. Runtime Verification is the field of research dedicated to the analysis of system executions. It is often seen as a discipline that studies how a system run satisfies or violates correctness properties. The report exposes a taxonomy of Runtime Verification (RV) presenting the terminology involved with the main concepts of the field. The report also develops the concept of instrumentation, the various ways to instrument systems, and the fundamental role of instrumentation in designing an RV framework. We also discuss how RV interplays with other verification techniques such as model-checking, deductive verification, model learning, testing, and runtime assertion checking. Finally, we propose challenges in monitoring quantitative and statistical data beyond detecting property violation.

--- Portuguese version As falhas de software est\~ao com frequ\^encia associadas a acidentes com graves consequ\^encias econ\'omicas e/ou humanas, pelo que se torna imperioso investir na valida\c{c}\~ao do software, nomeadamente daquele que \'e cr\'itico. Este artigo endere\c{c}a a tem\'atica da qualidade do software atrav\'es de uma an\'alise comparativa da usabilidade e efic\'acia de quatro ferramentas de an\'alise est\'atica de programas em C/C++. Este estudo permitiu compreender o grande potencial e o elevado impacto que as ferramentas de an\'alise est\'atica podem ter na valida\c{c}\~ao e verifica\c{c}\~ao de software. Como resultado complementar, foram identificados novos erros em programas de c\'odigo aberto e com elevada popularidade, que foram reportados. --- English version Software bugs are frequently associated with accidents with serious economical and/or human consequences, being thus imperative the investment in the validation of software, namely of the critical one. This article addresses the topic of software quality by making a comparative analysis of the usability and efficiency of four static analysis tools for C/C++ programs. This study allow to understand the big potential and high impact that these tools may have in the validation and verification of software. As a complementary result, we identified new errors in very popular open source projects, which have been reported., Comment: Article in Portuguese, accepted in the national informatics conference INForum (http://inforum.org.pt/INForum2018)

We study the geometry of equicharacteristic partial affine flag varieties associated to tamely ramified groups $G$ in characteristics $p>0$ dividing the order of the fundamental group $\pi_1(G_{\text{der}})$. We obtain that most Schubert varieties are not normal and provide an explicit criterion for when this happens. Apart from this, we show, on the one hand, that loop groups of semisimple groups satisfying $p \mid \lvert \pi_1(G_{\text{der}})\rvert$ are not reduced, and on the other hand, that their integral realizations are ind-flat. Our methods allow us to classify all tamely ramified Pappas-Zhu local models of Hodge type which are normal., Comment: 51 pages. Simplified proof of Thm. 2.5, rewrote part of Section 4, and added Appendix D. Accepted version at Ann. Sci. \'Ec. Norm. Sup\'er

Smart mobile devices are increasingly ubiquitous and are the primary source of user-generated content, and current communication infrastructures are failing in keeping up with the rising demand for the avid sharing of such content. To alleviate this problem and fully harness the amount of resources currently available at the network edge, mobile edge paradigms started to emerge. Though, application developers still struggle to tap that potential at the edge due to the lack of adequate communication and interaction abstractions. Thus, we propose a high-level abstraction that can be easily exploited by developers to design mobile edge applications focused on data dissemination. In this paper, we propose Thyme, a novel extended topic-based, time-aware publish/subscribe system for networks of mobile devices. In Thyme, time is a rst order dimension. Each subscription has an associated time frame, starting and ending either in the future, present, or past. Making the past available requires both subscriptions and publications to be persistently stored. We present the design of Thyme and evaluate it using simulation, discussing and characterizing the scenarios best suited for its use., Comment: 19 pages, 9 figures, preprint of paper submitted to Mobihoc 2018

We prove Riemann's theorems on extensions of functions over certain mixed characteristic analytic adic spaces, first introduced by Johansson and Newton. We use these results to reprove a theorem of de Jong identifying global sections of an $\mathcal{O}_K$-flat normal formal scheme, locally formally of finite type over $\mathcal{O}_K$, with locally powerbounded sections over the generic fibre., Comment: 20 pages

This paper presents Pot, a system that leverages the concept of preordered transactions to achieve deterministic multithreaded execution of programs that use Transactional Memory. Preordered transactions eliminate the root cause of nondeterminism in transactional execution: they provide the illusion of executing in a deterministic serial order, unlike traditional transactions which appear to execute in a nondeterministic order that can change from execution to execution. Pot uses a new concurrency control protocol that exploits the serialization order to distinguish between fast and speculative transaction execution modes in order to mitigate the overhead of imposing a deterministic order. We build two Pot prototypes: one using STM and another using off-the-shelf HTM. To the best of our knowledge, Pot enables deterministic execution of programs using off-the-shelf HTM for the first time. An experimental evaluation shows that Pot achieves deterministic execution of TM programs with low overhead, sometimes even outperforming nondeterministic executions, and clearly outperforming the state of the art., Comment: Published in ACM Transactions on Architecture and Code Optimization (TACO) 13, 4

Software developers are expected to protect concurrent accesses to shared regions of memory with some mutual exclusion primitive that ensures atomicity properties to a sequence of program statements. This approach prevents data races but may fail to provide all necessary correctness properties.The composition of correlated atomic operations without further synchronization may cause atomicity violations. Atomic violations may be avoided by grouping the correlated atomic regions in a single larger atomic scope. Concurrent programs are particularly prone to atomicity violations when they use services provided by third party packages or modules, since the programmer may fail to identify which services are correlated. In this paper we propose to use contracts for concurrency, where the developer of a module writes a set of contract terms that specify which methods are correlated and must be executed in the same atomic scope. These contracts are then used to verify the correctness of the main program with respect to the usage of the module(s). If a contract is well defined and complete, and the main program respects it, then the program is safe from atomicity violations with respect to that module. We also propose a static analysis based methodology to verify contracts for concurrency that we applied to some real-world software packages. The bug we found in Tomcat 6.0 was immediately acknowledged and corrected by its development team.

We construct a family of irreducible representations of the quantum plane and of the quantum Weyl algebra over an arbitrary field, assuming the deformation parameter is not a root of unity. We determine when two representations in this family are isomorphic, and when they are weight representations, in the sense of Bavula., Comment: 12 pages, Section 2 has been reorganized, new material added in a new Section 3

The main goal of Fiddle, a distributed debugging engine, is to provide a flexible platform for developing debugging tools. Fiddle provides a layered set of interfaces with a minimal set of debugging functionalities, for the inspection and control of distributed and multi-threaded applications. This paper illustrates how Fiddle is used to support integrated testing and debugging. The approach described is based on a tool, called Deipa, that interprets sequences of commands read from an input file, generated by an independent testing tool. Deipa acts as a Fiddle client, in order to enforce specific execution paths in a distributed PVM program. Other Fiddle clients may be used along with Deipa for the fine debugging at process level. Fiddle and Deipa functionalities and architectures are described, and a working example shows a step-by-step application of these tools., Comment: In M. Ronsse, K. De Bosschere (eds), proceedings of the Fifth International Workshop on Automated Debugging (AADEBUG 2003), September 2003, Ghent. cs.SE/0309027