The widespread deployment of multicore systems over the last decade has brought about major changes in the software and hardware landscape. The resulting importance of parallel computing is reflected in the 2013 Curriculum Guidelines developed by the joint ACM/IEEE taskforce. The document recommends increased coverage of parallel computing and describes a new Knowledge Area on this topic. These recommendations have already been adopted by several universities in the form of new parallel programming courses. Implementing the recommendations in a complete curriculum, however, poses many challenges, including deciding on existing material to be removed, complying with administrative and ABET requirements, and maintaining caps on graduation credit hours. This paper describes an alternative approach for adopting the 2013 curricular recommendations on parallel computing. Specifically, we use a module based approach that introduces parallel computing concepts and re-iterates them through a series of short, self-contained modules taught across several lower-division courses. Most of these concepts are then combined into a new senior-level capstone course on parallel programming. Each module covers parallelism aspects in the context of a conventional computer science topic, thus enabling us to include parallel computing without a major overhaul of the curriculum. Evaluations conducted during the first year show encouraging results for this early-and-often approach in terms of learning outcomes, student interest, and confidence gains.

Abstract A secure key management scheme for the locality caching multi‐root multi‐generation (LCMRMG) MANET routing algorithm is proposed. The scheme takes advantage of the multi‐root nature of LCMRMG and successfully integrates public key, certification and threshold technologies. The scheme is hierarchical and fully distributed. The key management operations are flexible in secure share distribution and scalable well to large MANET. Extensive simulations have shown that the scheme is secure, robust, efficient, and scalable. Copyright © 2007 John Wiley & Sons, Ltd.

We present a new and practical spanning tree based routing algorithm for mobile ad hoc networks (MANET). The algorithm, named LCMRMGCS, extends and significantly enhances the LCMRMG MANET routing algorithm previously proposed in W. Peng et al., (2003). Hosts in a LCMRMGCS MANET form non-overlapping trees. Our simulation results show that LCMRMGCS consistently outperforms LCMRMG in both maintenance cost and delivery ratio.

We present a secure key management scheme for the locality caching multi-root multi-generation (LCMRMG) MANET routing algorithm (W. Peng et al., 2003). The proposed scheme is fully distributed, flexible in secure share distribution, and scalable well to large MANET. The scheme takes advantage of the multi-root nature of LCMRMG and successfully integrates public key, certification and threshold technologies. Our simulation has proven that the proposed scheme is indeed secure, robust, efficient, and scalable

A locality caching multiroot multigeneration (LCMRMG) routing algorithm for mobile ad hoc networks (MANET). The LCMRMG algorithm extends and significantly enhances a previously proposed single-root MANET routing algorithm. Hosts in a LCMRMG MANET cache the locality of network traffic routing through them. Based on the cached locality statistics, a host can calculate the estimated reduction of network traffic if it becomes a new root router and can elect to do so if the reduction exceeds a predefined threshold value.

We propose a new concept for wavelength assignment in WDM all-optical networks-priority-based wavelength assignment. Our priority scheme is protocol-independent and can be easily integrated into any distributed wavelength assignment protocol. The proposed priority scheme has been integrated with the SIR (source initiated reservation) protocol. A new simulation software based on the well-known YACSIM simulation package was developed to show that the extended SIR protocol can improve the efficiency and throughput of WDM optical networks by five to ten percent. The proposed priority scheme should also be applicable to wide-area wavelength routed networks.

We present an extension of the classical PIM (protocol independent multicast) routing protocol, named PIM SWITCH, that allows PIM to dynamically switch between its shared tree sub-mode and shortest-path tree sub-mode. This extension enables PIM to better adapt to the changing networking environment. PIM SWITCH has been extensively, evaluated using our software tool MCS (multicast simulation) reported in a previous paper. Our simulation results reveal that PIM SWITCH performs well as expected with minimum overhead.

We describe a software tool MCS (multicast simulation) that we developed to evaluate routing protocols. MCS is based on several innovative ideas and provides a very user-friendly, flexible, and dynamically configurable GUI. We present results of applying MCS to the PIM (protocol independent multicast) routing protocol.

Fair reachability is a very useful technique in detecting errors of deadlocks and unspecified receptions in networks of communicating finite state machines (CFSMs) consisting of two machines. The paper extends the classical fair reachability technique, which is only applicable to the class of two-machine CFSMs, to the general class of CFSMs. For bounded CFSMs, the extended fair reachability technique reduces by more than one half the total number of reachable global states that have to be searched in verifying freedom from deadlocks. The usefulness of the new reachability technique, called even reachability, is demonstrated through two examples.

Reachability analysis and reverse reachability analysis are two important verification techniques for communicating finite state machines (CFSMs). The issue of the relative efficiency of reachability analysis and reverse reachability analysis is still unsettled. We first propose a new theory of reachability and reverse reachability analysis. Based on the new theory we discuss and analyze the suitability of these two reachability analysis methods. We then present a reachability evaluator, which, given any network of CFSMs, will try to estimate the sizes of the reachable and reverse reachable state spaces by taking snapshots of the reachability and reverse reachability spaces. The core of the evaluator is the notion of random state generation with seed states, which extends the idea of random state exploration proposed by West (1986). Results from example applications have shown that the evaluator provides guidance in choosing the better of the two methods.

We propose two variants of the classical communicating finite state machines (CFSMs) model, single-link communicating finite state machines (SLCFSMs) and time communicating finite state machines (TCFSMs). For SLCFSMs the notion of well-formedness, which provides a necessary condition for SLCFSMs to be free of some logical errors, is proposed. For TCFSMs, it is argued that they are more suitable for modeling delay-sensitive distributed algorithms/communication protocols. Two practical communication protocols, a token ring and a sliding window protocol, are modeled using TCFSMs.>

With Petri nets as the concurrent model, the issue of self-stabilizing communication protocols is discussed. It is argued that self-stabilizing extensions of communication protocols should not interfere with their normal operations by giving a new definition of self-stabilizing extension and a ring net that meets the new definition. It is also argued that communication protocols are usually delay sensitive and timed Petri nets provide a more suitable formal model than ordinary Petri nets to express the self-stabilizing property. The possibility and suitability of using Petri nets with a new type of transitions, the max transitions, to express self-stabilizing communication protocols is explored. To facilitate practical implementations, two types of interferences, external and internal interferences, are formally identified and discussed.>

Let ( F'l, Pz, . . . .Pm) be a network of n finite state machines, communicating with each other asynchronously using typed messages over unbounded FIFO channels, In this paper we present a data flow approach to analyzing these communicating machines for nonprogress properties (deadlock and unspecified reception).We set up flow equations to compute the set of pending messages in the queues at any given state of such a network, The central technical contribution of this paper is an algorithm to compute approximations to solutions for the ensuing equations We then show how these approximate solutions can be used to check that interactions between the processes are free of nonprogress errors.We conclude with a number of example protocols that our algorithm certifies to be free of nonprog-ess errors.Included in the examples is a specification of X25 call establishment/clear protocol,

The problem of testing two processes (specified as finite-state machines) communicating asynchronously with each other using send and receive commands over a set of message types is considered for two forms of nonprogress: deadlock and unspecified reception. Since the nonprogress problem is undecidable, a dataflow approach is used to obtain sufficient conditions under which the two processes are free of deadlock and unspecified reception. The approximation analysis is based on weakening the receive operation. Polynomial time algorithms are presented to perform the analysis. This problem arises in the context of dataflow analysis of the processes that communicate by message passing and in the context of showing correctness of protocol specifications. Diagrams are provided for some networks that can be certified to be free of unspecified receptions using the algorithms. The problem of testing for deadlock in more than two processes still remains open.>