On Clifford subalgebras, spacetime splittings and applications

Z(2)-gradings of Clifford algebras are reviewed and we shall be concerned with an alpha-grading based on the structure of inner automorphisms, which is closely related to the spacetime splitting, if we consider the standard conjugation map automorphism by an arbitrary, but fixed, splitting vector. After briefly sketching the orthogonal and parallel components of products of differential forms, where we introduce the parallel [orthogonal] part as the space [time] component, we provide a detailed exposition of the Dirac operator splitting and we show how the differential operator parallel and orthogonal components are related to the Lie derivative along the splitting vector and the angular momentum splitting bivector. We also introduce multivectorial-induced alpha-gradings and present the Dirac equation in terms of the spacetime splitting, where the Dirac spinor field is shown to be a direct sum of two quaternions. We point out some possible physical applications of the formalism developed.

Note on the point-splitting procedure to evaluate vacuum fluctuation in certain cylindrically symmetric backgrounds

We reexamine the two-point function approaches used to study vacuum fluctuation in wedge-shaped regions and conical backgrounds. The appearance of divergent integrals is discussed and circumvented. The issue is considered in the context of a massless scalar field in cosmic string spacetime.

Measurement of the Neutrino Mass Splitting and Flavor Mixing by MINOS

Measurements of neutrino oscillations using the disappearance of muon neutrinos from the Fermilab NuMI neutrino beam as observed by the two MINOS detectors are reported. New analysis methods have been applied to an enlarged data sample from an exposure of 7.25 x 10(20) protons on target. A fit to neutrino oscillations yields values of vertical bar Delta m(2)vertical bar = (2.32(-0.08)(+0.12) x 10(-3) eV(2) for the atmospheric mass splitting and sin(2)(2 theta) > 0.90 (90% C.L.) for the mixing angle. Pure neutrino decay and quantum decoherence hypotheses are excluded at 7 and 9 standard deviations, respectively.

Splitting of the zero-energy edge states in bilayer graphene

Bilayer graphene nanoribbons with zigzag termination are studied within the tight-binding model. We also include single-site electron-electron interactions via the Hubbard model within the unrestricted Hartree-Fock approach. We show that either the interactions between the outermost edge atoms or the presence of a magnetic order can cause a splitting of the zero-energy edge states. Two kinds of edge alignments are considered. For one kind of edge alignment (?) the system is nonmagnetic unless the Hubbard parameter U becomes greater than a critical value Uc. For the other kind of edge alignment (?) the system is magnetic for any U>0. Our results agree very well with ab initio density functional theory calculations.

Dynamical breaking of gauge symmetry in supersymmetric quantum electrodynamics in three-dimensional spacetime

The dynamical breaking of gauge symmetry in the supersymmetric quantum electrodynamics in three-dimensional spacetime is studied at two-loop approximation. At this level, the effective superpotential is evaluated in a supersymmetric phase. At one-loop order, we observe a generation of the Chern-Simons term due to a parity violating term present in the classical action. At two-loop order, the scalar background superfield acquires a nonvanishing vacuum expectation value, generating a mass term A(alpha)A(alpha) through the Coleman-Weinberg mechanism. It is observed that the mass of gauge superfield is predominantly an effect of the topological Chern-Simons term.

Contrasting LH-HH subband splitting of strained quantum wells grown along [001] and [113] directions

Contrasting responses for the temperature tuning of the electronic structure in semiconductor quantum wells are discussed for heterolayered structures grown along (001) and (113) directions. The temperature affects the strain modulation of the deformation potentials and the effective optical gap is tuned along with the intersub-band splitting in the valence band. A multiband theoretical model accounts for the characterization of the electronic structure, highlighting the main qualitative and quantitative differences between the two systems under study. The microscopic source of strain fields and the detailed mapping of their distribution are provided by a simulation using classical molecular-dynamics technics.

Skewness, splitting number and vertex deletion of some toroidal meshes

The skewness sk(G) of a graph G = (V, E) is the smallest integer sk(G) >= 0 such that a planar graph can be obtained from G by the removal of sk(C) edges. The splitting number sp(G) of C is the smallest integer sp(G) >= 0 such that a planar graph can be obtained from G by sp(G) vertex splitting operations. The vertex deletion vd(G) of G is the smallest integer vd(G) >= 0 such that a planar graph can be obtained from G by the removal of vd(G) vertices. Regular toroidal meshes are popular topologies for the connection networks of SIMD parallel machines. The best known of these meshes is the rectangular toroidal mesh C(m) x C(n) for which is known the skewness, the splitting number and the vertex deletion. In this work we consider two related families: a triangulation Tc(m) x c(n) of C(m) x C(n) in the torus, and an hexagonal mesh Hc(m) x c(n), the dual of Tc(m) x c(n) in the torus. It is established that sp(Tc(m) x c(n)) = vd(Tc(m) x c(n) = sk(Hc(m) x c(n)) = sp(Hc(m) x c(n)) = vd(Hc(m) x c(n)) = min{m, n} and that sk(Tc(m) x c(n)) = 2 min {m, n}.

Gravitational quasinormal modes of AdS black branes in d spacetime dimensions

The AdS/CFT duality has established a mapping between quantities in the bulk AdS black-hole physics and observables in a boundary finite-temperature field theory. Such a relationship appears to be valid for an arbitrary number of spacetime dimensions, extrapolating the original formulations of Maldacena`s correspondence. In the same sense properties like the hydrodynamic behavior of AdS black-hole fluctuations have been proved to be universal. We investigate in this work the complete quasinormal spectra of gravitational perturbations of d-dimensional plane-symmetric AdS black holes (black branes). Holographically the frequencies of the quasinormal modes correspond to the poles of two-point correlation functions of the field-theory stress-energy tensor. The important issue of the correct boundary condition to be imposed on the gauge-invariant perturbation fields at the AdS boundary is studied and elucidated in a fully d-dimensional context. We obtain the dispersion relations of the first few modes in the low-, intermediate- and high-wavenumber regimes. The sound-wave (shear-mode) behavior of scalar (vector)-type low- frequency quasinormal mode is analytically and numerically confirmed. These results are found employing both a power series method and a direct numerical integration scheme.

On the importance function in splitting simulation

The splitting method is a simulation technique for the estimation of very small probabilities. In this technique, the sample paths are split into multiple copies, at various stages in the simulation. Of vital importance to the efficiency of the method is the Importance Function (IF). This function governs the placement of the thresholds or surfaces at which the paths are split. We derive a characterisation of the optimal IF and show that for multi-dimensional models the natural choice for the IF is usually not optimal. We also show how nearly optimal splitting surfaces can be derived or simulated using reverse time analysis. Our numerical experiments illustrate that by using the optimal IF, one can obtain a significant improvement in simulation efficiency.

On the implementation of real-time slotbased task-splitting scheduling algorithms for multiprocessor systems

In this paper we discuss challenges and design principles of an implementation of slot-based tasksplitting algorithms into the Linux 2.6.34 version. We show that this kernel version is provided with the required features for implementing such scheduling algorithms. We show that the real behavior of the scheduling algorithm is very close to the theoretical. We run and discuss experiments on 4-core and 24-core machines.

Implementing slot-based task-splitting multiprocessor scheduling

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task-splitting scheduling algorithm. Task-splitting (also called semi-partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A particular type of task-splitting algorithms, called slot-based task-splitting dispatching, is of particular interest because of its ability to schedule tasks with high processor utilizations. Unfortunately, no slot-based task-splitting algorithm has been implemented in a real operating system so far. In this paper we discuss and propose some modifications to the slot-based task-splitting algorithm driven by implementation concerns, and we report the first implementation of this family of algorithms in a real operating system running Linux kernel version 2.6.34. We have also conducted an extensive range of experiments on a 4-core multicore desktop PC running task-sets with utilizations of up to 88%. The results show that the behavior of our implementation is in line with the theoretical framework behind it.

Practical aspects of slot-based task- splitting dispatching in its schedulability analysis

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.

Implementing multicore real-time scheduling algorithms based on task splitting using ada 2012

Multiprocessors, particularly in the form of multicores, are becoming standard building blocks for executing reliable software. But their use for applications with hard real-time requirements is non-trivial. Well-known realtime scheduling algorithms in the uniprocessor context (Rate-Monotonic [1] or Earliest-Deadline-First [1]) do not perform well on multiprocessors. For this reason the scientific community in the area of real-time systems has produced new algorithms specifically for multiprocessors. In the meanwhile, a proposal [2] exists for extending the Ada language with new basic constructs which can be used for implementing new algorithms for real-time scheduling; the family of task splitting algorithms is one of them which was emphasized in the proposal [2]. Consequently, assessing whether existing task splitting multiprocessor scheduling algorithms can be implemented with these constructs is paramount. In this paper we present a list of state-of-art task-splitting multiprocessor scheduling algorithms and, for each of them, we present detailed Ada code that uses the new constructs.

Unified overhead-aware schedulability analysis for slot-based task-splitting

Hard real- time multiprocessor scheduling has seen, in recent years, the flourishing of semi-partitioned scheduling algorithms. This category of scheduling schemes combines elements of partitioned and global scheduling for the purposes of achieving efficient utilization of the system’s processing resources with strong schedulability guarantees and with low dispatching overheads. The sub-class of slot-based “task-splitting” scheduling algorithms, in particular, offers very good trade-offs between schedulability guarantees (in the form of high utilization bounds) and the number of preemptions/migrations involved. However, so far there did not exist unified scheduling theory for such algorithms; each one was formulated in its own accompanying analysis. This article changes this fragmented landscape by formulating a more unified schedulability theory covering the two state-of-the-art slot-based semi-partitioned algorithms, S-EKG and NPS-F (both fixed job-priority based). This new theory is based on exact schedulability tests, thus also overcoming many sources of pessimism in existing analysis. In turn, since schedulability testing guides the task assignment under the schemes in consideration, we also formulate an improved task assignment procedure. As the other main contribution of this article, and as a response to the fact that many unrealistic assumptions, present in the original theory, tend to undermine the theoretical potential of such scheduling schemes, we identified and modelled into the new analysis all overheads incurred by the algorithms in consideration. The outcome is a new overhead-aware schedulability analysis that permits increased efficiency and reliability. The merits of this new theory are evaluated by an extensive set of experiments.