A so-called dead-zone pattern matching family of algorithms has previously been proposed as a concept. Here the performance of several instances of the family are empirically investigated. An abstract description of the algorithm family is given, as well as of these instances. This leads to a total of five different implementations of the algorithm. The time-performance of each of these implemented variants was then compared against those of the well-known Horspool and Boyer-Moore pattern matching algorithms, the latter being representative of the bestknown pattern matchers currently available. Various data sets, pattern selections and pattern lengths were used, but the same Horspool-like shift tables were used throughout by the dead-zone variants. It was found that in some contexts variants of the dead zone algorithm compare very favourably against the Horspool and Boyer-Moore algorithms.
a b s t r a c tIn this paper, the simulated performance of a number of differentiated services traffic conditioners is studied under a range of synthetic traffic conditions. The traffic conditioners are compared using two performance measures which are defined and justified in the paper.In the initial simulation the traffic conditioner performance differed in one measure but not the other. Further experimentation showed that one could get all the conditioners to have similar performance by setting carefully the configuration parameters of the conditioners.
We introduce a new CSP operator for modeling scenarios characterised by partial or optional parallelism. We provide examples of such scenarios and sketch the semantics of our operator. Relevant properties are proven. MotivationCSP was introduced more than 20 years ago [4,1,5] and remains a popular means of specifying communicating sequential processes. A fundamental assumption is that, under parallelism, all processes engaging in an event have to do so jointly [10,9]. In particular, the generalized parallel operator in indexed form, X n i=1 L i , requires that if one of the processes L i , i = 1 . . . n, is ready to engage in an event in X, then it cannot proceed until all the other processes are ready to engage in that same event.However, circumstances often arise where this requirement constrains the expressive capacity of CSP from a practical modeling perspective. For example, suppose that the L i processes above represent "listener" or "reader" processes, using a channel c to acquire information in the alphabet X ⊆ α(c) from some other "announcer" process, A.In practice, at any given moment a subset of listener processes may not be ready to act, when the rest are. Moreover, the context often requires that processing progresses, rather than waits for all processes to reach a ready state. Wireless sensor networks [2] are but one of many possible contexts. Here, the announcer could be a sensor node wanting to pass on information to all live surrounding nodes, bypassing those which might have become inactive because their power has run out.The CSP specification A X ( X n i=1 L i ) does not adequately model this scenario. It insists that all processes have to engage jointly in events in X. In this example, all the listener processes will have to be in the form c?x → L i , and the announcing process will have to be in the form c!x → A before any interaction can occur. This obligation to act jointly (e.g. listen or read) characterises all existing CSP parallel operators, whether synchronized, alphabetized or general.In some contexts, using the interleaving operator may ameliorate the problem sketched above. For example,L i ) means that when any L i is in the form c?x → L i and A is in the form c!x → L , then an interaction can take place. At best, then, such interleaving leads to an approximate specification, since only one of possibly several ready L i processes is non-deterministically chosen for interaction with A. (Note, however, that this form could express a supervisor-worker pattern: supervisor A successively communicates a sequence of independent subtasks to any available worker L i .)An alternative operator for modelling scenarios similar to the announcer-listener pattern or the reader part of the reader-writer pattern would evidently be of pragmatic value. It will be seen that if our new operator conjoins one or more processes (e.g. listeners or readers), then any one or more of these processes may synchronize with their environment. Since, synchronization is neither mandatory over all conjoined p...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2025 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.