233,113 research outputs found
`Electronic Publishing' -- Practice and Experience
Electronic Publishing -- Origination, Dissemination and Design (EP-odd) is an academic journal which publishes refereed papers in the subject area of electronic publishing. The authors of the present paper are, respectively, editor-in-chief, system software consultant and senior
production manager for the journal. EP-odd's policy is that editors, authors, referees and production staff will work closely together using electronic mail. Authors are also encouraged to originate their
papers using one of the approved text-processing packages together with the appropriate set of macros which enforce the layout style for the journal. This same software will then be used by the
publisher in the production phase. Our experiences with these strategies are presented, and two recently developed suites of software are described: one of these makes the macro sets available over
electronic mail and the other automates the flow of papers through the refereeing process. The decision to produce EP-odd in this way means that the publisher has to adopt production procedures
which differ markedly from those employed for a conventional journal
MOON: MapReduce On Opportunistic eNvironments
Abstract—MapReduce offers a flexible programming model for processing and generating large data sets on dedicated resources, where only a small fraction of such resources are every unavailable at any given time. In contrast, when MapReduce is run on volunteer computing systems, which opportunistically harness idle desktop computers via frameworks like Condor, it results in poor performance due to the volatility of the resources, in particular, the high rate of node unavailability. Specifically, the data and task replication scheme adopted by existing MapReduce implementations is woefully inadequate for resources with high unavailability. To address this, we propose MOON, short for MapReduce On Opportunistic eNvironments. MOON extends Hadoop, an open-source implementation of MapReduce, with adaptive task and data scheduling algorithms in order to offer reliable MapReduce services on a hybrid resource architecture, where volunteer computing systems are supplemented by a small set of dedicated nodes. The adaptive task and data scheduling algorithms in MOON distinguish between (1) different types of MapReduce data and (2) different types of node outages in order to strategically place tasks and data on both volatile and dedicated nodes. Our tests demonstrate that MOON can deliver a 3-fold performance improvement to Hadoop in volatile, volunteer computing environments
Special Libraries, December 1975
Volume 66, Issue 12https://scholarworks.sjsu.edu/sla_sl_1975/1009/thumbnail.jp
Event-Driven Molecular Dynamics in Parallel
Although event-driven algorithms have been shown to be far more efficient
than time-driven methods such as conventional molecular dynamics, they have not
become as popular. The main obstacle seems to be the difficulty of
parallelizing event-driven molecular dynamics. Several basic ideas have been
discussed in recent years, but to our knowledge no complete implementation has
been published yet. In this paper we present a parallel event-driven algorithm
including dynamic load-balancing, which can be easily implemented on any
computer architecture. To simplify matters our explanations refer to a basic
multi-particle system of hard spheres, but can be extended easily to a wide
variety of possible models.Comment: 10 pages, 9 figure
An apparently innocent problem in Membrane Computing
The search for effcient solutions of computationally hard problems by means
of families of membrane systems has lead to a wide and prosperous eld of research. The
study of computational complexity theory in Membrane Computing is mainly based on
the look for frontiers of effciency between different classes of membrane systems. Every
frontier provides a powerful tool for tackling the P versus NP problem in the following
way. Given two classes of recognizer membrane systems R1 and R2, being systems from
R1 non-effcient (that is, capable of solving only problems from the class P) and systems
from R2 presumably e cient (that is, capable of solving NP-complete problems), and
R2 the same class that R1 with some ingredients added, passing from R1 to R2 is
comparable to passing from the non effciency to the presumed effciency. In order to
prove that P = NP, it would be enough to, given a solution of an NP-complete problem
by means of a family of recognizer membrane systems from R2, try to remove the added
ingredients to R2 from R1. In this paper, we study if it is possible to solve SAT by
means of a family of recognizer P systems from AM0(�����d;+n), whose non-effciency was
demonstrated already
Special Libraries, December 1977
Volume 68, Issue 12https://scholarworks.sjsu.edu/sla_sl_1977/1008/thumbnail.jp
- …