148 research outputs found
Allocation of Parallel Real-Time Tasks in Distributed Multi-core Architectures supported by an FTT-SE Network
Distributed real-time systems such as automotive applications are becoming larger and more complex, thus,
requiring the use of more powerful hardware and software architectures. Furthermore, those distributed
applications commonly have stringent real-time constraints. This implies that such applications would gain in
flexibility if they were parallelized and distributed over the system. In this paper, we consider the problem of
allocating fixed-priority fork-join Parallel/Distributed real-time tasks onto distributed multi-core nodes connected
through a Flexible Time Triggered Switched Ethernet network. We analyze the system requirements and present a
set of formulations based on a constraint programming approach. Constraint programming allows us to express
the relations between variables in the form of constraints. Our approach is guaranteed to find a feasible solution,
if one exists, in contrast to other approaches based on heuristics. Furthermore, approaches based on constraint
programming have shown to obtain solutions for these type of formulations in reasonable time
An architecture for reliable distributed computer-controlled systems
In Distributed Computer-Controlled Systems (DCCS), both real-time and reliability
requirements are of major concern. Architectures for DCCS must be designed
considering the integration of processing nodes and the underlying communication
infrastructure. Such integration must be provided by appropriate software support
services.
In this paper, an architecture for DCCS is presented, its structure is outlined, and
the services provided by the support software are presented. These are considered in
order to guarantee the real-time and reliability requirements placed by current and
future systems
Improving the benefits of multicast prioritization algorithms
The final publication is available at Springer via http://dx.doi.org/10.1007/s11227-014-1087-zPrioritized atomic multicast consists in delivering messages in total order
while ensuring that the priorities of the messages are considered; i.e., messages with
higher priorities are delivered first. That service can be used in multiple applications.
An example is the usage of prioritization algorithms for reducing the transaction abort
rates in applications that use a replicated database system. To this end, transaction
messages get priorities according to their probability of violating the existing integrity
constraints. This paper evaluates how that abort reduction may be improved varying
the message sending rate and the bounds set on the length of the priority reordering
queue being used by those multicast algorithms.This work has been partially supported by EU FEDER and Spanish MICINN under research Grants TIN2009-14460-C03-01 and TIN2010-17193.Miedes De ElĂas, EP.; Muñoz EscoĂ, FD. (2014). Improving the benefits of multicast prioritization algorithms. Journal of Supercomputing. 68(3):1280-1301. doi:10.1007/s11227-014-1087-zS12801301683Amir Y, Danilov C, Stanton JR (2000) A low latency, loss tolerant architecture and protocol for wide area group communication. In: International Conference on Dependable Systems and Networks (DSN), IEEE-CS, Washington, DC, USA, pp 327–336Chockler G, Keidar I, Vitenberg R (2001) Group communication specifications: a comprehensive study. ACM Comput Surv 33(4):427–469CiA (2001) About CAN in Automation (CiA). http://www.can-cia.org/index.php?id=aboutciaDĂ©fago X, Schiper A, Urbán P (2004) Total order broadcast and multicast algorithms: taxonomy and survey. ACM Comput Surv 36(4):372–421Dolev D, Dwork C, Stockmeyer L (1987) On the minimal synchronism needed for distributed consensus. J ACM 34(1):77–97International Organization for Standardization (ISO) (1993) Road vehicles—interchange of digital information—controller area network (CAN) for high-speed communication. Revised by ISO 11898-1:2003JBoss (2011) The Netty project 3.2 user guide. http://docs.jboss.org/netty/3.2/guide/html/Kaashoek MF, Tanenbaum AS (1996) An evaluation of the Amoeba group communication system. In: International conference on distributed computing system (ICDCS), IEEE-CS, Washington, DC, USA, pp 436–448Miedes E, Muñoz-EscoĂ FD (2008) Managing priorities in atomic multicast protocols. In: International conference on availability, reliability and security (ARES), Barcelona, Spain, pp 514–519Miedes E, Muñoz-EscoĂ FD (2010) Dynamic switching of total-order broadcast protocols. In: International conference on parallel and distributed processing techniques and applications (PDPTA), CSREA Press, Las Vegas, Nevada, USA, pp 457–463Miedes E, Muñoz-EscoĂ FD, Decker H (2008) Reducing transaction abort rates with prioritized atomic multicast protocols. In: International European conference on parallel and distributed computing (Euro-Par), Springer, Las Palmas de Gran Canaria, Spain, Lecture notes in computer science, vol 5168, pp 394–403Mocito J, Rodrigues L (2006) Run-time switching between total order algorithms. In: International European conference on parallel and distributed computing (Euro-Par), Springer, Dresden, Germany, Lecture Notes in Computer Science, vol 4128, pp 582–591Moser LE, Melliar-Smith PM, Agarwal DA, Budhia R, Lingley-Papadopoulos C (1996) Totem: a fault-tolerant multicast group communication system. Commun ACM 39(4):54–63Nakamura A, Takizawa M (1992) Priority-based total and semi-total ordering broadcast protocols. In: International conference on distributed computing systems (ICDCS), Yokohama, Japan, pp 178–185Nakamura A, Takizawa M (1993) Starvation-prevented priority based total ordering broadcast protocol on high-speed single channel network. In: 2nd International symposium on high performance distributed computing (HPDC), pp 281–288Rodrigues L, VerĂssimo P, Casimiro A (1995) Priority-based totally ordered multicast. In: Workshop on algorithms and architectures for real-time control (AARTC), Ostend, BelgiumRĂĽtti O, Wojciechowski P, Schiper A (2006) Structural and algorithmic issues of dynamic protocol update. In: 20th International parallel and distributed processing symposium (IPDPS), IEEE-CS Press, Rhodes Island, GreeceTindell K, Clark J (1994) Holistic schedulability analysis for distributed hard real-time systems. Microprocess Microprogr 40(2–3):117–134Tully A, Shrivastava SK (1990) Preventing state divergence in replicated distributed programs. In: International symposium on reliable distributed systems (SRDS), Huntsville, Alabama, USA, pp 104–113Wiesmann M, Schiper A (2005) Comparison of database replication techniques based on total order broadcast. IEEE Trans Knowl Data Eng 17(4):551–56
Freshness and Reactivity Analysis in Globally Asynchronous Locally Time-Triggered Systems
International audienceCritical embedded systems are often designed as a set of real-time tasks, running on shared computing modules, and communicating through networks. Because of their critical nature, such systems have to meet timing properties. To help the designers to prove the correctness of their system, the real-time systems community has developed numerous approaches for analyzing the worst case times either on the processors (e.g. worst case execution time of a task) or on the networks (e.g. worst case traversal time of a message). However, there is a growing need to consider the complete system and to be able to determine end-to-end properties. Such properties apply to a functional chain which describes the behavior of a sequence of functions, not necessarily hosted on a shared module, from an input until the production of an output. This paper explores two end-to-end properties: freshness and reactivity, and presents an analysis method based on Mixed Integer Linear Programming (MILP). This work is supported by the French National Research Agency within the Satrimmap project
Exact Speedup Factors and Sub-Optimality for Non-Preemptive Scheduling
Fixed priority scheduling is used in many real-time systems; however, both preemptive and non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to an optimal uniprocessor scheduling algorithm such as preemptive earliest deadline first (EDF-P). In this paper, we investigate the sub-optimality of fixed priority non-preemptive scheduling. Specifically, we derive the exact processor speed-up factor required to guarantee the feasibility under FP-NP (i.e. schedulability assuming an optimal priority assignment) of any task set that is feasible under EDF-P. As a consequence of this work, we also derive a lower bound on the sub-optimality of non-preemptive EDF (EDF-NP). As this lower bound matches a recently published upper bound for the same quantity, it closes the exact sub-optimality for EDF-NP. It is known that neither preemptive, nor non-preemptive fixed priority scheduling dominates the other, in other words, there are task sets that are feasible on a processor of unit speed under FP-P that are not feasible under FP-NP and vice-versa. Hence comparing these two algorithms, there are non-trivial speedup factors in both directions. We derive the exact speed-up factor required to guarantee the FP-NP feasibility of any FP-P feasible task set. Further, we derive the exact speed-up factor required to guarantee FP-P feasibility of any constrained-deadline FP-NP feasible task set
Exploring Web-Based University Policy Statements on Plagiarism by Research-Intensive Higher Education Institutions
Plagiarism may distress universities in the US, but there is little agreement as to exactly what constitutes plagiarism. While there is ample research on plagiarism, there is scant literature on the content of university policies regarding it. Using a systematic sample, we qualitatively analyzed 20 Carnegie-classified universities that are “Very High in Research.” This included 15 public state universities and five high-profile private universities. We uncovered highly varied and even contradictory policies at these institutions. Notable policy variations existed for verbatim plagiarism, intentional plagiarism and unauthorized student collaboration at the studied institutions. We conclude by advising that the American Association of University Professors (AAUP), the American Association of Colleges and Universities (AACU) and others confer and come to accord on the disposition of these issues
Designer receptors show role for ventral pallidum input to ventral tegmental area in cocaine seeking.
The ventral pallidum is centrally positioned within mesocorticolimbic reward circuits, and its dense projection to the ventral tegmental area (VTA) regulates neuronal activity there. However, the ventral pallidum is a heterogeneous structure, and how this complexity affects its role within wider reward circuits is unclear. We found that projections to VTA from the rostral ventral pallidum (RVP), but not the caudal ventral pallidum (CVP), were robustly Fos activated during cue-induced reinstatement of cocaine seeking--a rat model of relapse in addiction. Moreover, designer receptor-mediated transient inactivation of RVP neurons, their terminals in VTA or functional connectivity between RVP and VTA dopamine neurons blocked the ability of drug-associated cues (but not a cocaine prime) to reinstate cocaine seeking. In contrast, CVP neuronal inhibition blocked cocaine-primed, but not cue-induced, reinstatement. This double dissociation in ventral pallidum subregional roles in drug seeking is likely to be important for understanding the mesocorticolimbic circuits underlying reward seeking and addiction
- …