Sensitivity and pointing accuracy of the NEMO km3^3 telescope

n this paper we present the results of Monte Carlo simulation studies on the capability of the proposed NEMO km3 telescope to detect high energy neutrinos. We calculated the detector sensitivity to muon neutrinos coming from a generic point-like source. We also simulated the lack of atmospheric muons in correspondence to the Moon disk in order to determine the detector angular resolution and to check the absolute pointing capability.Comment: To be published on VLVNT2 proceedings (Catania, Italy, November 8-11, 2005

An approach to rollback recovery of collaborating mobile agents

Fault-tolerance is one of the main problems that must be resolved to improve the adoption of the agents' computing paradigm. In this paper, we analyse the execution model of agent platforms and the significance of the faults affecting their constituent components on the reliable execution of agent-based applications, in order to develop a pragmatic framework for agent systems fault-tolerance. The developed framework deploys a communication-pairs independent check pointing strategy to offer a low-cost, application-transparent model for reliable agent- based computing that covers all possible faults that might invalidate reliable agent execution, migration and communication and maintains the exactly-one execution property

Baryon masses with dynamical twisted mass fermions

We present results on the mass of the nucleon and the $\Delta$ using two dynamical degenerate twisted mass quarks. The evaluation is performed at four quark masses corresponding to a pion mass in the range of 690-300 MeV on lattices of size 2.1 fm and 2.7 fm. We check for cutoff effects by evaluating these baryon masses on lattices of spatial size 2.1 fm with lattice spacings $a(\beta=3.9)=0.0855(6)$ fm and $a(\beta=4.05)=0.0666(6)$ fm, determined from the pion sector and find them to be within our statistical errors. Lattice results are extrapolated to the physical limit using continuum chiral perturbation theory. The nucleon mass at the physical point provides a determination of the lattice spacing. Using heavy baryon chiral perturbation theory at ${\cal O}(p^3)$ we find $a(\beta=3.9)=0.0879(12)$ fm, with a systematic error due to the chiral extrapolation estimated to be about the same as the statistical error. This value of the lattice spacing is in good agreement with the value determined from the pion sector. We check for isospin breaking in the $\Delta$-system. We find that $\Delta^{++,-}$ and $\Delta^{+,0}$ are almost degenerate pointing to small flavor violating effects.Comment: 7 pages, 9 figures. Talk presented at the XXV International Symposium on Lattice Field Theory, July 30 - August 4 2007, Regensburg, German

A novel architecture for large windows processors

Several processor architectures with large instruction windows have been proposed. They improve performance by maintaining hundreds of instructions in flight to increase the level of instruction parallelism (ILP). Such architectures replace a re-order buffer (ROB) with a check-pointing mechanism and an out-of-order release of the processor resources. Check-pointing, however, leads to an imprecise state recovery on mispredicted branches and exceptions and frequent re-execution of current-path instructions during the state recovery. It also requires large register files complicating renaming, allocation and release of physical registers. This technical report proposes a new processor architecture that does not use either a traditional ROB or check-pointing, avoids the above-mentioned problems, and has a fast, distributed state recovery mechanism. Its novel register management architecture allows implementation of large register files with simpler and more scalable, register renaming and commit. It is also key to the precise recovery mechanism.Postprint (published version

A distributed processor state management architecture for large-window processors

Processor architectures with large instruction windows have been proposed to expose more instruction-level parallelism (ILP) and increase performance. Some of the proposed architectures replace a re-order buffer (ROB) with a check-pointing mechanism and an out-of-order release of processor resources. Check-pointing, however, leads to an imprecise processor state recovery on mis-predicted branches and exceptions and re-execution of correct-path instructions after state recovery. It also requires large register files complicating renaming, allocation and release of physical registers. This paper proposes a new processor architecture called a Multi-State Processor (MSP). The MSP does not use check-pointing, avoids the above-mentioned problems, and has a fast, distributed state recovery mechanism. The MSP uses a novel register management architecture allowing implementation of large register files with simpler and more scalable register allocation, renaming, and release. It is also key to precise processor state recovery mechanism. The MSP is shown to improve IPC by 14%, on average, for integer SPEC CPU2000 benchmarks compared to a check-pointing based mechanism ([2]) when a fast and simple branch predictor is used. With a very aggressive branch predictor the IPC improvement is 1%, on average, and 3% if some of the programs are optimized for the MSP. The MSP also reduces the average number of executed instructions by 16.5% (12% for the aggressive branch predictor), mostly due to precise state recovery. This improves the MSP processor energy efficiency even though it uses a larger register file.Peer ReviewedPostprint (published version

On threshold resummation beyond leading 1-x order

We check against exact finite order three-loop results for the non-singlet F_2 and F_3 structure functions the validity of a class of momentum space ansaetze for threshold resummation at the next-to-leading order in 1-x, which generalize results previously obtained in the large-\beta_0 limit. We find that the ansaetze do not work exactly, pointing towards an obstruction to threshold resummation at this order, but still yield correct results at the leading logarithmic level for each color structures, as well as at the next-to-next-to-leading logarithmic level for the specific C_F^3 color factor. A universality of the leading logarithm contributions to the physical evolution kernels of F_2 and F_3 at the next-to-leading order in 1-x is observed.Comment: v1:18 pages; v2: 26 pages, expanded version with new results for the F_3 structure function and added references; v3: more concise sections 3 and 4, improved discussion in section 5, added references, to be published in JHE

Analysis of check pointing protocols for mobile distributed systems

Mobile Distributed Systems (MDS) are susceptible to faults. It is not easy to predict whether the system will prolong to perform throughout or till approved time. Checkpointing based Fault tolerance enables a system to continue properly, in the event of failure. Checkpoint is defined as a nominated place in a program at which normal process is broken up distinctively to conserve the status information, needed to allow recommencement of processing at a later time in case of a failure.  Checkpointing algorithms for mobile distributed systems come across new issues such as mobility, low bandwidth of wireless channels, disconnections, limited battery power and lack of reliable stable storage on mobile nodes. This paper gives a summary of checkpointing strategies for mobile networks which are categories on the basis of QOS of wireless networks, based on mobile agents, considering the mobility of MHs and transmission of checkpoints

Commissioning the UPM satellite simulator facility platform

The purpose of this paper is to test and validate the UPM Satellite Simulator Facility (SSF) platform. The work relates to satellite testing and qualification experiments. The satellite Attitude Determination and Control System (ADCS) consist of flight-proven equipment from Canada, Germany and America. The flight hardware check has to be performed for the SSF qualification. Therefore, dedicated test procedures in order to test and verify the satellite control mode (i.e., Idle mode, Detumble mode, Coarse Pointing mode and Fine Pointing mode) has to be implemented. The results of these experiments are discussed to qualify the health of the satellite itself and the ADCS equipment. The UPM SSF responded very well to all the conducted tests and therefore, its performances are validated