Implementation of a Distributed Computation Framework
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This paper addresses the problem of efficient scheduling of large clusters under high load and heterogeneous workloads. A heterogeneous workload typically consists of many short jobs and a small number of large jobs that consume the bulk of the cluster's r ...
Using the chromophore of the green fluorescent protein (GFP), the performance of a hybrid RI-CC2/polarizable embedding (PE) model is tested against a quantum chemical cluster approach. Moreover, the effect of the rest of the protein environment is studied ...
Cloud computing promises flexibility and high performance for users and high cost-efficiency for operators. Nevertheless, most cloud facilities operate at very low utilization, hurting both cost effectiveness and future scalability. We present Quasar, a cl ...
This paper investigates the role of business models for exploiting digital options within digital clusters (that are clusters where collaboration is IT-dependent). To this aim, this research focuses on digital platforms, a specific IT artifact supporting a ...
This paper proposes a novel Plug-and-Play (PnP) dynamic approach for the monitoring of Large-Scale Systems (LSSs). The proposed architecture exploits a distributed Fault Detection and Isolation (FDI) methodology for nonlinear LSS in a PnP framework. The LS ...
This paper shows for the first time that distributed computing can be both reliable and efficient in an environment that is both highly dynamic and hostile. More specifically, we show how to maintain clusters of size O(log N), each containing more than two ...
Distributed processing over networks relies on in-network processing and cooperation among neighboring agents. Cooperation is beneficial when all agents share the same objective or belong to the same group. However, if agents belong to different clusters o ...
High performance computing will probably reach exascale in this decade. At this scale, mean time between failures is expected to be a few hours. Existing fault tolerant protocols for message passing applications will not be efficient anymore since they eit ...
The first tetrameric cation-cation neptunyl(v) cluster, [NpO 2(salen) 4(μ 8-K) 2][K(18C6)Py] 2, has been synthesized in non-aqueous solution from the reaction of [(NpO 2Py 5)(KI 2Py 2)] n with K 2salen and its structure determined in the solid state and in ...
Due to high scaling order of MP2 and CCSD(T) methods, it is either difficult or at times even impossible to treat even moderately sized molecular systems with elaborate basis sets such as aug-cc-pVXZ (X = D, T, Q). In the present work, several structures o ...
