text:
Grav 1.0.10, the previous stable version, was released Feb 11th 2016, and it has proved to be extremely solid and reliable. Over the past 5 months, we've not slowed development, in fact we have made over 3000 commits to fix bugs, add features, and generally improve Grav even further!
Grav 1.1 is a large update that You can get an idea of the amount of work that has gone into Grav 1.1 Core from the extensive changelog that covers what's been added, improved, and fixed. The admin plugin has received a similar amount of attention, with nearly 2000 commits between the last stable release and the new 1.1 version.
However a brief summary of some of the things you will find in Grav 1.1 is as follows:
Grav 1.1 Features
- New Advanced Form Blueprints. Read about this powerful new functionality in the documentation.
- GPM Versioning. You can now specify requirements of dependencies. Such as requiring a specific version of another plugin or Grav itself.
- GPM Channels. We now support a
Stablechannel in GPM. This allows us to release beta releases without affecting stable installations. Simply release your plugin/theme as a
pre-releasein GitHub and add the
testing: trueflag in the blueprints.yaml, it will then be handled automatically as a beta release.
- Core Grav Processor Refactor. Thanks to toovy for a great refactor of Grav's core processing to make things more readable and flexible.
- Multi-part Downloads. This offers resumable downloads and streaming/looping HTML5 video
- Twig Processing in Frontmatter. This optional setting lets you use Twig variables in your frontmatter for all sorts of powerful setups.
- Blueprints in Plugins. We now allow the option for plugins to provide blueprints, not just themes.
- Developer CLI Tools. This is broken out into a new plugin but allows a developer to quickly create a scaffold for a new plugin or theme.
- Authentication of Proxies. Grav now supports authenticated proxy servers.
- Override default Parsedown functionality. Thanks to maxlysenko for adding this functionality.
- Assets handling improved. You can now exclude external files, control the before/after order of the pipelined files and better support the
absolute_urls: trueoption. Also cache is refreshed when files are modified.
- Improved Asset minification logic to ensure more reliable compression.
- Grav-served images support browser caching. Grav now automatically sets header variables to ensure images are cached properly.
- Individual localhost environments. Previously all localhost environments were handled by 'localhost', now we support virtual hosts as individual environments which allows for better mimicking of staging/production environments.
- More PHP Stream conversion. We've moved more hard-coded paths to streams to allow better multi-site support.
- Allow local themes outside of GPM. A new theme blueprint option
gpm: falsemeans you can have a local theme with the same name as a GPM theme and not have it overwritten or updated.
- Added Memcache and Redis Caching options.
- Improved GPM installation with dependencies. This whole process has been much improved.
- Added many more new tests. We've added many more new tests to better help us ensure compatibility with code changes. Feel free to contribute and add more! When it comes to testing, the more the merrier!
- Many Many Bug Fixes. Grav should be more reliable than ever with this new version that contains many bug fixes.
Admin Plugin 1.1 Features
- JavaScript Rewrite. Admin is now built in ES6
- Default Theme Refactored. The default theme has been heavily refactored and has much better mobile support. You can also no collapse the sidebar manually as well as auto-switching to smaller sidebar on narrow devices.
- Nested Lists. Often requested in the 1.0 release, you can now have any field inside a list form field type!
- Improved File Upload Field. You can now use uploads in pages, themes, plugins and configuration. Supports drag-n-drop too!
- Editor Rebuilt. Our CodeMirror based editor has been rewritten to be more flexible and also is available in any form, not just on pages.
- Color Picker Field. We've added a powerful new color picker field that you can use as needed.
- More Flexible File Upload Field. You can now use the file upload field pretty much anywhere in the admin.
- Ability to Prepend and Append Text Fields. Particular useful if you wan to add a some context to your input fields.
- Admin can now install dependencies. Previously only available with the CLI command, if you install a plugin with dependencies you will be prompted to also install any dependencies.
- Ability to filter and sort Plugins and Themes. Now you can locate themes easier than ever before.
- Improved Page Preview. Now there is a more consistent look to page previews that is pleasing to the eyes.
- Allow login via email. You now have the choice to login via email or username.
- Testing/Stable option. Configure this option dynamically in the Add Plugin and Add Theme pages.
- New Datepicker Field. The new one is more flexible and translatable compared to the previous version.
- Persistent States. We've added more persistent states for trees and tabs throughout the admin. So now those states are remembered after a page reload.
- Redirect on Login. Going to an admin login that needed authentication, you will now be redirected to your originally requested page, not just dumped into the dashboard.
- Admin Unique Cache. The admin's cache is now unique from the frontend
site. This improves reliablility in several areas that was caused by front-end plugins and functionality corrupting admin data.
- User Profile Layout Improved. A UI cleanup on this page improves readability.
- Many Many Bug Fixes. Too numerous to count, but we've squashed many bugs in the admin in this version.
Upgrading to Grav v1.1 is an absolute doddle! If you already have the admin plugin installed, you simple click the Update Grav Now button to upgrade Grav Core itself, and then the Update button in the Maintenance section (or individually in the Plugins and Themes sections) to upgrade all Plugins and Themes.
If you don't have the admin plugin installed, you can use Grav's built-in package manager to update to the latest version of the Grav Core:
$ bin/gpm self-upgrade
This will download the 'update' package and install it automatically. After this you should also check for any updates to Plugins and Themes and install those as required:
$ bin/gpm update
Thanks to the Grav Community
We just wanted to give a huge thanks to our awesome community that has helped us identify issues, test fixes, provide pull requests, and overall helped Grav 1.1 to be a fantastic release packed full of good stuff you have asked for. If you have not already done so, please join us on our Slack chat room.
Grav 1.1 is a huge part of our original 2016 Plans for Grav. Now it's out of the door, we are turning our attention back to the Admin Pro plugin and Gantry5 for Grav.


text:
On the hard-real-time scheduling of embedded streaming applications
- First Online:
- Received:
- Accepted:
- Citations
- 1.1k Downloads
In this paper, we consider the problem of hard-real-time (HRT) multiprocessor scheduling of embedded streaming applications modeled as acyclic dataflow graphs. Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to dataflow graphs, where nodes represent actors (i.e., tasks) and edges represent data-dependencies. The actors in such graphs have data-dependency constraints and do not necessarily conform to the periodic or sporadic task models. In this work, we prove that the actors in acyclic Cyclo-Static Dataflow (CSDF) graphs can be scheduled as periodic tasks. Moreover, we provide a framework for computing the periodic task parameters (i.e., period and start time) of each actor, and handling sporadic input streams. Furthermore, we define formally a class of CSDF graphs called matched input/output (I/O) rates graphs which represents more than 80 % of streaming applications. We prove that strictly periodic scheduling is capable of achieving the maximum achievable throughput of an application for matched I/O rates graphs. Therefore, hard-real-time schedulability analysis can be used to determine the minimum number of processors needed to schedule matched I/O rates applications while delivering the maximum achievable throughput. This can be of great use for system designers during the Design Space Exploration (DSE) phase.
KeywordsReal-time multiprocessor scheduling Embedded streaming systems
1 Introduction
The ever-increasing complexity of embedded systems realized as Multi-Processor Systems-on-Chips (MPSoCs) is imposing several challenges on systems designers [18]. Two major challenges in designing streaming software for embedded MPSoCs are: (1) How to express parallelism found in applications efficiently?, and (2) How to allocate the processors to provide guaranteed services to multiple running applications, together with the ability to dynamically start/stop applications without affecting other already running applications?
Model-of-Computation (MoC) based design has emerged as a de-facto solution to the first challenge [10]. In MoC-based design, the application can be modeled as a directed graph where nodes represent actors (i.e., tasks) and edges represent communication channels. Different MoCs define different rules and semantics on the computation and communication of the actors. The main benefits of a MoC-based design are the explicit representation of important properties in the application (e.g., parallelism) and the enhanced design-time analyzability of the performance metrics (e.g., throughput). One particular MoC that is popular in the embedded signal processing systems community is the Cyclo-Static Dataflow (CSDF) model [5] which extends the well-known Synchronous Data Flow (SDF) model [15].
Unfortunately, no such de-facto solution exists yet for the second challenge of processor allocation [23]. For a long time, self-timed scheduling was considered the most appropriate policy for streaming applications modeled as dataflow graphs [14, 28]. However, the need to support multiple applications running on a single system without prior knowledge of the properties of the applications (e.g., required throughput, number of tasks, etc.) at system design-time is forcing a shift towards run-time scheduling approaches as explained in [13]. Most of the existing run-time scheduling solutions assume applications modeled as task graphs and provide best-effort or soft-real-time quality-of-service (QoS) [23]. Few run-time scheduling solutions exist which support applications modeled using a MoC and provide hard-real-time QoS [4, 11, 20, 21]. However, these solutions either use simple MoCs such as SDF/PGM graphs or use Time-Division Multiplexing (TDM)/Round-Robin (RR) scheduling. Several algorithms from the hard-real-time multiprocessor scheduling theory [9] can perform fast admission and scheduling decisions for incoming applications while providing hard-real-time QoS. Moreover, these algorithms provide temporal isolation which is the ability to dynamically start/run/stop applications without affecting other already running applications. However, these algorithms from the hard-real-time multiprocessor scheduling theory received little attention in the embedded MPSoC community. This is mainly due to the fact that these algorithms assume independent periodic or sporadic tasks [9]. Such a simple task model is not directly applicable to modern embedded streaming applications. This is because a modern streaming application is typically modeled as a directed graph where nodes represent actors, and edges represent data-dependencies. The actors in such graphs have data-dependency constraints and do not necessarily conform to the periodic or sporadic task models.
Therefore, in this paper we investigate the applicability of the hard-real-time scheduling theory for periodic tasks to streaming applications modeled as acyclic CSDF graphs. In such graphs, the actors are data-dependent. However, we analytically prove that they (i.e., the actors) can be scheduled as periodic tasks. As a result, a variety of hard-real-time scheduling algorithms for periodic tasks can be applied to schedule such applications with a certain guaranteed throughput. By considering acyclic CSDF graphs, our investigation findings and proofs are applicable to most streaming applications since it has been shown recently that around 90 % of streaming applications can be modeled as acyclic SDF graphs [30]. Note that SDF graphs are a subset of the CSDF graphs we consider in this paper.
1.1 Problem statement
Given a streaming application modeled as an acyclic CSDF graph, determine whether it is possible to execute the graph actors as periodic tasks. A periodic task τi is defined by a 3-tuple τi=(Si,Ci,Ti). The interpretation is as follows: τi is invoked at time instants t=Si+kTi and it has to execute for Ci time-units before time t=Si+(k+1)Ti for all k∈ℕ0, where Si is the start time of τi and Ti is the task period. This scheduling approach is called Strictly Periodic Scheduling (SPS) [22] to avoid confusion with the term periodic scheduling used in the dataflow scheduling theory to refer to a repetitive finite sequence of actors invocations. The sequence is periodic since it is repeated infinitely with a constant period. However, the individual actors invocations are not guaranteed to be periodic. In the remainder of this paper, periodic scheduling/schedule refers to strictly periodic scheduling/schedule.
1.2 Paper contributions
Given a streaming application modeled as an acyclic CSDF graph, we analytically prove that it is possible to execute the graph actors as periodic tasks. Moreover, we present an analytical framework for computing the periodic task parameters for the actors, that is the period and the start time, together with the minimum buffer sizes of the communication channels such that the actors execute as periodic tasks. The proposed framework is also capable of handling sporadic input streams. Furthermore, we define formally two classes of CSDF graphs: matched input/output (I/O) rates graphs and mis-matched I/O rates graphs. Matched I/O rates graphs constitute around 80 % of streaming applications [30]. We prove that strictly periodic scheduling is capable of delivering the maximum achievable throughput for matched I/O rates graphs. Applying our approach to matched I/O rates applications enables using a plethora of schedulability tests developed in the real-time scheduling theory [9] to easily determine the minimum number of processors needed to schedule a set of applications using a certain algorithm to provide the maximum achievable throughput. This can be of great use for embedded systems designers during the Design Space Exploration (DSE) phase.
The remainder of this paper is organized as follows: Sect. 2 gives an overview of the related work. Section 3 introduces the CSDF model and the considered system model. Section 4 presents the proposed analytical framework. Section 5 presents the results of empirical evaluation of the framework presented in Sect. 4. Finally, Sect. 6 ends the paper with conclusions.
2 Related work
Parks and Lee [25] studied the applicability of non-preemptive Rate-Monotonic (RM) scheduling to dataflow programs modeled as SDF graphs. The main difference compared to our work is: (1) they considered non-preemptive scheduling. In contrast, we consider only preemptive scheduling. Non-preemptive scheduling is known to be NP-hard in the strong sense even for the uniprocessor case [12], and (2) they considered SDF graphs which are a subset of the more general CSDF graphs.
Goddard [11] studied applying real-time scheduling to dataflow programs modeled using the Processing Graphs Method (PGM). He used a task model called Rate-Based Execution (RBE) in which a real-time task τi is characterized by a 4-tuple τi=(xi,yi,di,ci). The interpretation is as follows: τi executes xi times in time period yi with a relative deadline di per job release and ci execution time per job release. For a given PGM, he developed an analysis technique to find the RBE task parameters of each actor and buffer size of each channel. Thus, his approach is closely related to ours. However, our approach uses CSDF graphs which are more expressive than PGM graphs in that PGM supports only a constant production/consumption rate on edges (same as SDF), whereas CSDF supports varying (but predefined) production/consumption rates. As a result, the analysis technique in [11] is not applicable to CSDF graphs.
Bekooij et al. presented a dataflow analysis for embedded real-time multiprocessor systems [4]. They analyzed the impact of TDM scheduling on applications modeled as SDF graphs. Moreira et al. have investigated real-time scheduling of dataflow programs modeled as SDF graphs in [20, 21, 22]. They formulated a resource allocation heuristic [20] and a TDM scheduler combined with static allocation policy [21]. Their TDM scheduler improves the one proposed in [4]. In [22], they proved that it is possible to derive a strictly periodic schedule for the actors of a cyclic SDF graph iff the periods are greater than or equal to the maximum cycle mean of the graph. They formulated the conditions on the start times of the actors in the equivalent Homogeneous SDF (HSDF, [15]) graph in order to enforce a periodic execution of every actor as a Linear Programming (LP) problem.
Our approach differs from [4, 20, 21, 22] in: (1) using the periodic task model which allows applying a variety of proven hard-real-time scheduling algorithms for multiprocessors, and (2) using the CSDF model which is more expressive than the SDF model.
3 Background
3.1 Cyclo-static dataflow (CSDF)
- 1.The successors set, denoted by succ(vi), and given by:$$ \mathsf{succ}(v_i) = \bigl\{ v_j \in V : \exists e_u = (v_i, v_j) \in E \bigr\} $$(1)
- 2.The predecessors set, denoted by prec(vi), and given by:$$ \mathsf{prec}(v_i) = \bigl\{ v_j \in V : \exists e_u = (v_j, v_i) \in E \bigr\} $$(2)
- 3.The input channels set, denoted by inp(vi), and given by:$$ \mathsf{inp}(v_i) = \left \{ \begin{array}{l@{\quad}l} \{ e_u \in E : e_u = (v_j, v_i) \}, & \mbox{if } \sigma_i >1 \\ \mbox{The set of channels delivering the input streams to } v_i & \mbox{if } \sigma_i = 1 \end{array} \right . $$(3)
- 4.The output channels set, denoted by out(vi), and given by:$$ \mathsf{out}(v_i) = \left\{ \begin{array}{l@{\quad}l} \{e_u \in E : e_u = (v_i, v_j)\}, & \mbox{if } \sigma_i <\mathcal{L}\\ \mbox{The set of channels carrying the output streams from } v_i, & \mbox{if } \sigma_i = \mathcal{L} \end{array} \right. $$(4)
Every actor vj∈V has an execution sequence [fj(1),fj(2),…,fj(Pj)] of length Pj. The interpretation of this sequence is: The nth time that actor vj is fired, it executes the code of function fj(((n−1)modPj)+1). Similarly, production and consumption of tokens are also sequences of length Pj in CSDF. The token production of actor vj on channel eu is represented as a sequence of constant integers \([x_{j}^{u}(1), x_{j}^{u}(2), \ldots, x_{j}^{u}(P_{j})]\). The nth time that actor vj is fired, it produces \(x_{j}^{u}(((n - 1) \bmod P_{j}) + 1)\) tokens on channel eu. The consumption of actor vk is completely analogous; the token consumption of actor vk from a channel eu is represented as a sequence \([y_{k}^{u}(1), y_{k}^{u}(2), \ldots, y_{k}^{u}(P_{j})]\). The firing rule of a CSDF actor vk is evaluated as "true" for its nth firing iff all its input channels contain at least \(y_{k}^{u}(((n - 1) \bmod P_{j}) + 1)\) tokens. The total number of tokens produced by actor vj on channel eu during the first n invocations, denoted by \(X_{j}^{u}(n)\), is given by \(X_{j}^{u}(n) = \sum_{l = 1}^{n} x_{j}^{u}(l)\). Similarly, the total number of tokens consumed by actor vk from channel eu during the first n invocations, denoted by \(Y_{k}^{u}(n)\), is given by \(Y_{k}^{u}(n) = \sum_{l = 1}^{n} y_{k}^{u}(l)\).
Example 1
An important property of the CSDF model is its decidability, which is the ability to derive at compile-time a schedule for the actors. This is formulated in the following definitions and results from [5].
Definition 1
(Valid static schedule [5])
Given a connected CSDF graph G, a valid static schedule for G is a finite sequence of actors invocations that can be repeated infinitely on the incoming sample stream while the amount of data in the buffers remains bounded. A vector q=[q1,q2,…,qN]T, where qj>0, is a repetition vector of G if each qj represents the number of invocations of an actor vj in a valid static schedule for G. The repetition vector of G in which all the elements are relatively prime1 is called the basic repetition vector of G, denoted by \(\dot{\mathbf{q}}\). G is consistent if there exists a repetition vector. If a deadlock-free schedule can be found, G is said to be live. Both consistency and liveness are required for the existence of a valid static schedule.
Theorem 1
Definition 2
For a consistent and live CSDF graph G, an actor iteration is the invocation of an actor vi∈V for qi times, and a graph iteration is the invocation of every actor vi∈V for qi times, where qi∈q.
Corollary 1
(From [5])
If a consistent and live CSDF graphGcompletesniterations, wheren∈ℕ, then the net change to the number of tokens in the buffers ofGis zero.
Lemma 1
Any acyclic consistent CSDF graph is live.
Bilsen et al. proved in [5] that a CSDF graph is live iff every cycle in the graph is live. Equivalently, a CSDF graph deadlocks only if it contains at least one cycle. Thus, absence of cycles in a CSDF graph implies its liveness. □
Example 2
3.2 System model and scheduling algorithms
In this section, we introduce the system model and the related schedulability results.
3.2.1 System model
A system Ω consists of a set π={π1,π2,…,πm} of m homogeneous processors. The processors execute a task set τ={τ1,τ2,…,τn} of n periodic tasks, and a task may be preempted at any time. A periodic task τi∈τ is defined by a 4-tuple τi=(Si,Ci,Ti,Di), where Si≥0 is the start time of τi, Ci>0 is the worst-case execution time of τi, Ti≥Ci is the task period, and Di, where Ci≤Di≤Ti, is the relative deadline of τi. A periodic task τi is invoked (i.e., releases a job) at time instants t=Si+kTi for all k∈ℕ0. Upon invocation, τi executes for Ci time-units. The relative deadline Di is interpreted as follows: τi has to finish executing its kth invocation before time t=Si+kTi+Di for all k∈ℕ0. If Di=Ti, then τi is said to have implicit-deadline. If Di<Ti, then τi is said to have constrained-deadline. If all the tasks in a task-set τ have the same start time, then τ is said to be synchronous. Otherwise, τ is said to be asynchronous.
The utilization of a task τi is Ui=Ci/Ti. For a task set τ, the total utilization of τ is \(U_{\mathrm{sum}} = \sum_{\tau_{i} \in\tau} U_{i}\) and the maximum utilization factor of τ is \(U_{\mathrm{max}} = \max_{\tau_{i} \in\tau} U_{i}\).
In the remainder of this paper, a task set τ refers to an asynchronous set of implicit-deadline periodic tasks. As a result, we refer to a task τi with a 3-tuple τi=(Si,Ci,Ti) by omitting the implicit deadline Di which is equal to Ti.
3.2.2 Scheduling asynchronous set of implicit deadline periodic tasks
Partitioned: Each task is allocated to a processor and no migration is permitted
Global: Migration is permitted for all tasks
- Hybrid: Hybrid algorithms mix partitioned and global approaches and they can be further classified to:
- 1.
Semi-partitioned: Most tasks are allocated to processors and few tasks are allowed to migrate
- 2.
Clustered: Processors are grouped into clusters and the tasks that are allocated to one cluster are scheduled by a global scheduler
- 1.
MPAR is specific to the task set τ for which it is computed. Another task set \(\hat{\tau}\) with the same total utilization and maximum utilization factor as τ might not be schedulable on MPAR processors due to partitioning issues.
4 Strictly periodic scheduling of acyclic CSDF graphs
This section presents our analytical framework for scheduling the actors in acyclic CSDF graphs as periodic tasks. The construction it uses arranges the actors forming the CSDF graph into a set of levels as shown in Sect. 3. All actors belonging to a certain level depend directly only on the actors in the previous levels. Then, we derive, for each actor, a period and start time, and for each channel, a buffer size. These derived parameters ensure that a strictly periodic schedule can be achieved in the form of a pipelined sequence of invocations of all the actors in each level.
4.1 Definitions and assumptions
In the remainder of this paper, a graph G refers to an acyclic consistent CSDF graph. We base our analysis on the following assumptions:
Assumption 1
- 1.
Zi∩Zj=∅ ∀vi,vj∈V.
- 2.
The first samples of all the streams arrive prior to or at the same time when the actors of G start executing
- 3.
Each input stream Ij is characterized by a minimum inter-arrival time (also called period) of the samples, denoted by γj. This minimum inter-arrival time is assumed to be equal to the period of the input actor which receives Ij. This assumption indicates that the inter-arrival time for input streams can be controlled by the designer to match the periods of the actors.
Assumption 2
An actor vi consumes its input data immediately when it starts its firing and produces its output data just before it finishes its firing.
We start with the following definition:
Definition 3
(Execution time vector)
Let \(\eta= \max_{v_{i} \in V}(\mu_{i} q_{i})\) and Q=lcm{q1,q2,…,qN} (lcm denotes the least-common-multiple operator). Now, we give the following definition.
Definition 4
(Matched input/output rates graph)
The concept of matched I/O rates applications was first introduced in [30] as the applications with low value ofQ. However, the authors did not establish exact test for determining whether an application is matched I/O rates or not. The test in (13) is a novel contribution of this paper. If ηmodQ=0, then there exists at least a single actor in the graph which is fully utilizing the processor on which it runs. This, as shown later in Sect. 4.3.3, allows the graph to achieve optimal throughput. On the other hand, if ηmodQ≠0, then there exist idle durations in the period of each actor which results in sub-optimal throughput. This is illustrated later in Example 3 which shows the strictly periodic schedule of a mis-matched I/O rates application.
Definition 5
(Output path latency)
Let wa⇝z={(va,vb),…,(vy,vz)} be an output path in a graph G. The latency of wa⇝z under periodic input streams, denoted by L(wa⇝z), is the elapsed time between the start of the first firing of va which produces data to (va,vb) and the finish of the first firing of vz which consumes data from (vy,vz).
Consequently, we define the maximum latency of G as follows:
Definition 6
(Graph maximum latency)
Definition 7
(Self-timed schedule)
A self-timed schedule (STS) is one where all the actors are fired as soon as their input data are available.
Definition 8
(Strictly periodic actor)
An actor vi∈V is strictly periodic iff the time period between any two consecutive firings is constant.
Definition 9
(Period vector)
Definition 9 implies that all the actors have the same iteration period. This is captured in the following definition:
Definition 10
(Iteration period)
Now, we prove the existence of a strictly periodic schedule when the input streams are strictly periodic. An input stream Ij connected to input actor vi is strictly periodic iff the inter-arrival time between any two consecutive samples is constant. Based on Assumption 1-3, it follows that γj=λi. Later on, we extend the results to handle periodic with jitter and sporadic input streams.
4.2 Existence of a strictly periodic schedule
Lemma 2
Theorem 2
For any graphG, a periodic scheduleΠexists such that every actorvi∈Vis strictly periodic with a constant periodλi∈λminand every communication channeleu∈Ehas a bounded buffer capacity.
In schedule Π∞, every actor vi is fired every λi time-unit once it starts. The start time defined in (26) guarantees that actors in a given level will start only when they have enough data to execute one iteration in a periodic way. The overlapping guarantees that once the actors have started, they will always find enough data for executing the next iteration since their predecessors have already executed one additional iteration. Thus, schedule Π∞ shows the existence of a periodic schedule of G where every actor vj∈V is strictly periodic with a period equal to λj.
Example 3
4.3 Earliest start times and minimum buffer sizes
Now, we are interested in finding the earliest start times of the actors, and the minimum buffer sizes of the communication channels that guarantee the existence of a periodic schedule. Minimizing the start times and buffer sizes is crucial since it minimizes the initial response time and the memory requirements of the applications modeled as acyclic CSDF graphs.
4.3.1 Earliest start times
In the proof of Theorem 2, the notion of start time was introduced to denote when the actor is started on the system. The start time values used in the proof of the theorem were not the minimum ones. Here, we derive the earliest start times. We start with the following definitions:
Definition 11
(Cumulative production function)
The cumulative production function of actor vi producing into channel eu during the interval [ts,te), denoted by \(\mathsf{prd}_{[t_{s}, t_{e})} (v_{i},e_{u})\), is the sum of the number of tokens produced by vi into eu during the interval [ts,te).
Similarly, we define the cumulative consumption function as follows:
Definition 12
(Cumulative consumption function)
The cumulative consumption function of actor vi consuming from channel eu over the interval [ts,te], denoted by \(\mathsf{cns}_{[t_{s}, t_{e}]}(v_{i},e_{u})\), is the sum of the number of tokens consumed by vi from eu during the interval [ts,te].
Recall that prec(vi) is the predecessors set of actor vi, \(Y_{i}^{u}\) is the consumption sequence of an actor vi from channel eu, and α is the iteration period. Now, we give the following lemma:
Lemma 3
In (36), a valid start time candidate ϕi→j must satisfy extra conditions to guarantee that the number of produced tokens on edge eu=(vi,vj) at any time instant \(t \ge\hat{t}\) is greater than or equal to the number of consumed tokens at the same instant. To satisfy these extra conditions, we consider the following two possible cases:
Satisfying (37) guarantees that vj can fire at times \(t = \hat{t}, \hat{t} + \lambda_{j}, \ldots, \hat{t} + \alpha\). Thus, a valid value of \(\hat{t}\) guarantees that once vj is started, it always finds enough data to fire for one iteration. As a result, vj executes in a strictly periodic way.
This case occurs when vj consumes zeros tokens during the interval \([\hat{t},\phi_{i}]\). This is a valid behavior since the consumption rates sequence can contain zero elements. Since \(\hat{t} < \phi_{i}\), it is sufficient to check the cumulative production and consumption over the interval [ϕi,ϕi+α] since by time t=ϕi+α both vi and vj are guaranteed to have finished one iteration. Thus, \(\hat{t}\) also guarantees that once vj is started, it always finds enough data to fire. Hence, vj executes in a strictly periodic way.
Any value of \(\hat{t}\) which satisfies (39) is a valid start time value that guarantees strictly periodic execution of vj. Since there might be multiple values of \(\hat{t}\) that satisfy (39), we take the minimum value because it is the earliest start time that guarantees strictly periodic execution of vj. □
4.3.2 Minimum buffer sizes
Lemma 4
Equation (40) tracks the maximum cumulative number of unconsumed tokens in eu during one iteration for vi and vj. There are two cases:
Theorem 3
- 1.
every edgeeu∈Ehas a capacity of at leastbutokens, wherebuis given by (40)
- 2.
τGsatisfies the schedulability test of\(\mathcal{A}\)onMprocessors
Follows from Theorem 2, and Lemmas 3 and 4. □
Example 4
4.3.3 Throughput and latency analysis
Now, we analyze the throughput of the graph actors under strictly periodic scheduling and compare it with the maximum achievable throughput. We also present a formula to compute the latency for a given CSDF graph under strictly periodic scheduling. We start with the following definitions:
Definition 13
(Actor throughput)
Definition 14
(Rate-optimal strictly periodic schedule [22])
For a graph G, a strictly periodic schedule that delivers the same throughput as a self-timed schedule for all the actors is called Rate-Optimal Strictly Periodic Schedule (ROSPS).
Now, we provide the following result.
Theorem 4
For a matched I/O rates graphG, the maximum achievable throughput of the graph actors under strictly periodic scheduling is equal to their maximum throughput under self-timed scheduling.
Equation (44) shows that the throughput under SPS depends solely on the relationship between Q and η. Recall from Definition 3 that the execution time μ used by our framework is the maximum value over all the actual execution times of the actor. Therefore, if ηmodQ=0, then RSPS(vi) is exactly the same as RSTS(vi) for SDF graphs and CSDF graphs where all the firings of an actor vi require the same actual execution time. If ηmodQ≠0 and/or the actor actual execution time differs per firing, then RSPS(vi) is lower than RSTS(vi). These findings illustrate that our framework has high potential since it allows the designer to analytically determine the type of the application (i.e., matched vs. mis-matched) and accordingly to select the proper scheduler needed to deliver the maximum achievable throughput.
Now, we prove the following result regarding matched I/O rates applications:
Corollary 2
For a matched I/O rates graphGscheduled using its minimum period vectorλmin, Umax=1.
Recall from Sect. 3.2.2 that β=⌊1/Umax⌋. It follows from Corollary 2 that β=1 for matched I/O rates applications scheduled using their minimum period vectors.
4.4 Handling sporadic input streams
In case the input streams are not strictly periodic, there are several techniques to accommodate the aperiodic nature of the streams. We present here some of these techniques.
4.4.1 De-jitter buffers
In case of periodic with jitter input streams, it is possible to use de-jitter buffers to hide the effect of jitter. We assume that a jittery input stream Ii starts at time t=t0 and has a constant inter-arrival time γi equal to the input actor period (see Assumption 1-3) and jitter bounds \([\varepsilon_{i}^{-}, \varepsilon_{i}^{+}]\). The interpretation of the jitter bounds is that the kth sample of the stream is expected to arrive in the interval \([t_{0} + k\gamma_{i} - \varepsilon_{i}^{-}, t_{0} + k\gamma_{i} + \varepsilon_{i}^{+}]\). If a sample arrives in the interval \([t_{0} + k\gamma_{i} - \varepsilon_{i}^{-}, t_{0} + k\gamma_{i})\), then it is called an early sample. On the other hand, if the sample arrives in the interval \((t_{0} + k\gamma_{i}, t_{0} + k\gamma_{i} + \varepsilon_{i}^{+}]\), then it is called a late sample. It is trivial to show that early samples do not affect the periodicity of the input actor as the samples arrive prior to the actor release time. Late samples, however, pose a problem as they might arrive after an actor is released.
For late samples, it is possible to insert a buffer before each input actor vi receiving a jittery input stream Ij to hide the effect of jitter. The buffer delays delivering the samples to the input actor by a certain amount of time, denoted by tbuffer(Ij). tbuffer(Ij) has to be computed such that once the input actor is started, it always finds data in the buffer. Assume that \(\varepsilon_{i}^{-}\) and \(\varepsilon_{i}^{+} \in[0, \gamma_{i}]\), then we can derive the minimum value for tbuffer(Ij) and the minimum buffer size. In order to do that, we start with proving the following lemma:
Lemma 5
Lemma 6
During a time interval (t,t+tMIT(Ij)), vi can fire at most twice. Therefore, it is necessary to buffer up to 2 samples in order to guarantee that the input actor vi can continue firing periodically when the samples are separated by tMIT time-units. □
Lemma 7
Letvibe an input actor andIjbe a jittery input stream tovi. Suppose thatIjstarts at timet=t0andvistarts at timet=t0+tbuffer(Ij). The de-jitter buffer must be able to hold at least 3 samples.
Suppose that the (k−1) and (k+1) samples arrive late and early, respectively, by the maximum amount of jitter. This means that they arrive at time t=t0+kγi. Now, suppose that the kth sample arrives with no jitter. This means that at time t=t0+kγi there are 3 samples arriving. Hence, the de-jitter buffer must be able to store them. During the interval [t0+kγi,t0+(k+1)γi), there are no incoming samples and vi processes the (k−1) sample. At time t=t0+(k+1)γi, the (k+2) sample might arrive which means that there are again 3 samples available to vi. By the periodicity of vi and Ij, the previous pattern can repeat. □
The main advantage of the de-jitter buffer approach is that the actors are still treated and scheduled as periodic tasks. However, the major disadvantage is the extra delay encountered by the input stream samples and the extra memory needed for the buffers.
4.4.2 Resource reservation
For sporadic streams in general, we can consider the actors as aperiodic tasks and apply techniques for aperiodic task scheduling from real-time scheduling theory [6]. One popular approach is based on using a server task to service the aperiodic tasks. Servers provide resource reservation guarantees and temporal isolation. Several servers have been proposed in the literature (e.g., [1, 27]). The advantages of using servers are the enforced isolation between the tasks, and the ability to support arbitrarily input streams. When using servers, we can schedule each actor using a server which has an execution budget Cs equal to the actor execution time and a period Ps equal to the actor's period.
- 1.
The underlying operating system (OS) or scheduler has a monitoring mechanism which polls the buffers to detect when an actor has enough data to fire. Once it detects that an actor has enough data to fire, it releases an actor job.
- 2.Modify the actor implementation such that the polling happens within the actor. In this approach, an actor job is always released at the start of the actor period. When the actor is activated (i.e., running), it checks its input buffers for data. If enough data is available, then it executes its function. Otherwise, it exhausts its budget and waits until the next period. This mechanism is summarized in Fig. 12.
The first approach (i.e., polling by the OS) does not require modifications to the actors' implementations. However, it requires an additional task which always checks all the buffers. This task can become a bottleneck if there are many channels. The second approach is better in terms of scalability and overhead. However, it might cause delays in the processing of the data.
5 Evaluation results
We evaluate our proposed framework in Sect. 4 by performing an experiment on a set of 19 real-life streaming applications. The objective of the experiment is to compare the throughput of streaming applications when scheduled using our strictly periodic scheduling to their maximum achievable throughput obtained via self-timed scheduling. After that, we discuss the implications of our results from Sect. 4 and the throughput comparison experiment. For brevity, we refer in the remainder of this section to our strictly periodic scheduling/schedule as SPS and the self-timed scheduling/schedule as STS.
The streaming applications used in the experiment are real-life streaming applications coming from different domains (e.g., signal processing, communication, multimedia, etc.). The benchmarks are described in details in the next section.
5.1 Benchmarks
Benchmarks used for evaluation
Signal Processing
Multi-channel beamformer
Discrete cosine transform (DCT)
Fast Fourier transform (FFT) kernel
Filterbank for multirate signal processing
Time delay equalization (TDE)
Data Encryption Standard (DES)
Bitonic Parallel Sorting
Video processing
MPEG2 video
H.263 video decoder
Audio processing
MP3 audio decoder
CD-to-DAT rate converter (SDF)a
CD-to-DAT rate converter (CSDF)
Software FM radio with equalizer
Data modem
Satellite receiver
Digital Radio Mondiale receiver
Heart pacemakerb
We use the SDF3 tool-set [29] for several purposes during the experiments. SDF3 is a powerful analysis tool-set which is capable of analyzing CSDF and SDF graphs to check for consistency errors, compute the repetition vector, compute the maximum achievable throughput, etc. SDF3 accepts the graphs in XML format. For StreamIt benchmarks, the StreamIt compiler is capable of exporting an SDF graph representation of the stream program. The exported graph is then converted into the XML format required by SDF3. For the graphs from the research articles, we constructed the XML representation for the CSDF graphs manually.
5.2 Experiment: throughput and latency comparison
In this experiment, we compare the throughput and latency resulting from our SPS approach to the maximum achievable throughput and minimum achievable latency of a streaming application. Recall from Definition 7 that the maximum achievable throughput and minimum achievable latency of a streaming application modeled as a CSDF graph are the ones achieved under self-timed scheduling. In this experiment, we report the throughput for the output actors (i.e., the actors producing the output streams of the application, see Sect. 3). For latency, we report the graph maximum latency according to Definition 6. For SPS, we used the minimum period vector given by Lemma 2. The STS throughput and latency are computed using the SDF3 tool-set. SDF3 defines RSTS(G) as the graph throughput under STS, and RSTS(vi)=qiRSTS(G) as the actor throughput. Similarly, LSTS(G) denotes the graph latency under self-timed scheduling. We use the sdf3analysis tool from SDF3 to compute the throughput and latency for the STS with auto-concurrency disabled and assuming unbounded FIFO channel sizes. Computing the throughput is performed using the throughput algorithm, while latency is computed using the latency(min_st) algorithm.
Results of throughput comparison. vout denotes the output actor
5.3 Discussion
Unfortunately, such easy computation as discussed above of the minimum number of processors is not possible for STS. This is because the minimum number of processors required by STS, denoted by MSTS, can not be easily computed with equations such as (9), (10), and (11). Finding MSTS in practice requires Design Space Exploration (DSE) procedures to find the best allocation which delivers the maximum achievable throughput. This fact shows one more advantage of using our SPS framework compared to using STS in cases where our SPS gives the same throughput as STS.
6 Conclusions
We prove that the actors of a streaming application, modeled as an acyclic CSDF graph, can be scheduled as periodic tasks. As a result, a variety of hard-real-time scheduling algorithms for periodic tasks can be applied to schedule such applications with a certain guaranteed throughput. We present an analytical framework for computing the periodic task parameters for the actors together with the minimum channel sizes such that a strictly periodic schedule exists. We also show how the proposed framework can handle sporadic input streams. We define formally a class of CSDF graphs called matched I/O rates applications which represents more than 80 % of streaming applications. We prove that strictly periodic scheduling is capable of delivering the maximum achievable throughput for matched I/O rates applications together with the ability to analytically determine the minimum number of processors needed to schedule the applications.
- 1.
I.e., gcd{q1,q2,…,qN}=1.
This work is supported by CATRENE/MEDEA+ 2A718 TSAR (Terascale multicore processor architecture) project. We would like to thank William Thies and Sander Stuijk for their support with StreamIt and SDF3 benchmarks, respectively.
Open Access
This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
- 1.Abeni L, Buttazzo G (1998) Integrating multimedia applications in hard real-time systems. In: Proceedings of the 19th IEEE real-time systems symposium (RTSS), pp 4–13. doi:10.1109/REAL.1998.739726 Google Scholar
- 2.Anderson JH, Srinivasan A (2001) Mixed Pfair/ERfair scheduling of asynchronous periodic tasks. In: Proceedings of the 13th Euromicro conference on real-time systems (ECRTS 2001), pp 76–85. doi:10.1109/EMRTS.2001.934004 Google Scholar
- 3.Andersson B, Tovar E (2006) Multiprocessor scheduling with few preemptions. In: Proceedings of the 12th IEEE international conference on embedded and real-time computing systems and applications (RTCSA 2006), pp 322–334. doi:10.1109/RTCSA.2006.45 Google Scholar
- 4.Bekooij M, Hoes R, Moreira O, Poplavko P, Pastrnak M, Mesman B, Mol J, Stuijk S, Gheorghita V, Meerbergen J (2005) Dataflow analysis for real-time embedded multiprocessor system design. In: Dynamic and robust streaming in and between connected consumer-electronic devices, vol 3. Springer, Amsterdam, pp 81–108. doi:10.1007/1-4020-3454-7_4 CrossRefGoogle Scholar
- 5.Bilsen G, Engels M, Lauwereins R, Peperstraete J (1996) Cyclo-static dataflow. IEEE Trans Signal Process 44(2):397–408. doi:10.1109/78.485935 CrossRefGoogle Scholar
- 6.Buttazzo GC (2011) Hard real-time computing systems, 3rd edn. Springer, Berlin. doi:10.1007/978-1-4614-0676-1 CrossRefMATHGoogle Scholar
- 7.Carpenter J, Funk S, Holman P, Srinivasan A, Anderson J, Baruah S (2004) A categorization of real-time multiprocessor scheduling problems and algorithms. In: Leung JYT (ed) Handbook of scheduling: algorithms, models, and performance analysis. CRC Press, Boca Raton. doi:10.1201/9780203489802.ch30 Google Scholar
- 8.Cho H, Ravindran B, Jensen ED (2010) T-L plane-based real-time scheduling for homogeneous multiprocessors. J Parallel Distrib Comput 70(3):225–236. doi:10.1016/j.jpdc.2009.12.003 CrossRefMATHGoogle Scholar
- 9.Davis RI, Burns A (2011) A survey of hard real-time scheduling for multiprocessor systems. ACM Comput Surv 43:35:1–35:44. doi:10.1145/1978802.1978814 CrossRefGoogle Scholar
- 10.Gerstlauer A, Haubelt C, Pimentel AD, Stefanov TP, Gajski DD, Teich J (2009) Electronic system-level synthesis methodologies. IEEE Trans Comput-Aided Des Integr Circuits Syst 28(10):1517–1530. doi:10.1109/TCAD.2009.2026356 CrossRefGoogle Scholar
- 11.Goddard S (1998) On the management of latency in the synthesis of real-time signal processing systems from processing graphs. PhD thesis, University of North Carolina at Chapel Hill Google Scholar
- 12.Jeffay K, Stanat D, Martel C (1991) On non-preemptive scheduling of periodic and sporadic tasks. In: Proceedings of the 12th real-time systems symposium (RTSS 1991), pp 129–139. doi:10.1109/REAL.1991.160366 CrossRefGoogle Scholar
- 13.Karam L, AlKamal I, Gatherer A, Frantz G, Anderson D, Evans B (2009) Trends in multicore DSP platforms. IEEE Signal Process Mag 26(6):38–49. doi:10.1109/MSP.2009.934113 CrossRefGoogle Scholar
- 14.Lee EA, Ha S (1989) Scheduling strategies for multiprocessor real-time DSP. In: IEEE global telecommunications conference and exhibition: communications technology for the 1990s and beyond (GLOBECOM 1989), vol 2, pp 1279–1283. doi:10.1109/GLOCOM.1989.64160 Google Scholar
- 15.Lee EA, Messerschmitt DG (1987) Synchronous data flow. Proc IEEE 75(9):1235–1245. doi:10.1109/PROC.1987.13876 CrossRefGoogle Scholar
- 16.Levin G, Funk S, Sadowski C, Pye I, Brandt S (2010) DP-FAIR: a simple model for understanding optimal multiprocessor scheduling. In: Proceedings of the 22nd Euromicro conference on real-time systems (ECRTS 2010), pp 3–13. doi:10.1109/ECRTS.2010.34 CrossRefGoogle Scholar
- 17.López JM, Díaz JL, García DF (2004) Utilization bounds for EDF scheduling on real-time multiprocessor systems. Real-Time Syst 28:39–68. doi:10.1023/B:TIME.0000033378.56741.14 CrossRefMATHGoogle Scholar
- 18.Martin G (2006) Overview of the MPSoC design challenge. In: Proceedings of the 43rd annual design automation conference (DAC 2006), pp 274–279. doi:10.1145/1146909.1146980 Google Scholar
- 19.Moonen A, Bekooij M, van den Berg R, van Meerbergen J (2008) Cache aware mapping of streaming applications on a multiprocessor system-on-chip. In: Proceedings of the conference on design, automation and test in Europe (DATE 2008), pp 300–305. doi:10.1145/1403375.1403448 Google Scholar
- 20.Moreira O, Mol JD, Bekooij M, van Meerbergen J (2005) Multiprocessor resource allocation for hard-real-time streaming with a dynamic job-mix. In: Proceedings of the 11th IEEE real time and embedded technology and applications symposium (RTAS 2005), pp 332–341. doi:10.1109/RTAS.2005.33 Google Scholar
- 21.Moreira O, Valente F, Bekooij M (2007) Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor. In: Proceedings of the 7th ACM & IEEE international conference on embedded software (EMSOFT 2007), pp 57–66. doi:10.1145/1289927.1289941 CrossRefGoogle Scholar
- 22.Moreira OM, Bekooij MJG (2007) Self-timed scheduling analysis for real-time applications. EURASIP J Adv Signal Process 2007:1–15. doi:10.1155/2007/83710 CrossRefGoogle Scholar
- 23.Nollet V, Verkest D, Corporaal H (2010) A safari through the MPSoC run-time management jungle. Signal Process Syst 60:251–268. doi:10.1007/s11265-008-0305-4 CrossRefGoogle Scholar
- 24.Oh H, Ha S (2004) Fractional rate dataflow model for efficient code synthesis. J VLSI Signal Process 37:41–51. doi:10.1023/B:VLSI.0000017002.91721.0e CrossRefGoogle Scholar
- 25.Parks T, Lee E (1995) Non-preemptive real-time scheduling of dataflow systems. In: Proceedings of the 1995 international conference on acoustics, speech, and signal processing (ICASSP 1995), vol 5, pp 3235–3238. doi:10.1109/ICASSP.1995.479574 CrossRefGoogle Scholar
- 26.Pellizzoni R, Meredith P, Nam MY, Sun M, Caccamo M, Sha L (2009) Handling mixed-criticality in SoC-based real-time embedded systems. In: Proceedings of the 7th ACM international conference on embedded software (EMSOFT 2009), pp 235–244. doi:10.1145/1629335.1629367 CrossRefGoogle Scholar
- 27.Sprunt B, Sha L, Lehoczky J (1989) Aperiodic task scheduling for hard-real-time systems. Real-Time Syst 1:27–60. doi:10.1007/BF02341920 CrossRefGoogle Scholar
- 28.Sriram S, Bhattacharyya SS (2009) Embedded multiprocessors: scheduling and synchronization, 2nd edn. CRC Press, Boca Raton. doi:10.1201/9781420048025 CrossRefGoogle Scholar
- 29.Stuijk S, Geilen M, Basten T (2006) SDFT3: SDF for free. In: Proceedings of the 6th international conference on application of concurrency to system design (ACSD 2006), pp 276–278. doi:10.1109/ACSD.2006.23 CrossRefGoogle Scholar
- 30.Thies W, Amarasinghe S (2010) An empirical characterization of stream programs and its implications for language and compiler design. In: Proceedings of the 19th international conference on parallel architectures and compilation techniques (PACT 2010), pp 365–376. doi:10.1145/1854273.1854319 Google Scholar

subset: commoncrawl


text: The Technē Trekker is a mobile media art studio designed to bring UB media art and performance to audiences throughout Greater Buffalo and Western New York. The Trekker offers projection and installation capabilities and a light and sound system. UB faculty and students are eligible to reserve the Trekker. If interested, please contact firstname.lastname@example.com with the subject line "Trekker Reservation."


text:
Recommended Hotel: Hampton Inn
Why: Free Breakfast, Wifi, Parking, Great Rates, Reviews
There are a few hotels near the Greenbelt Metro station which also services as a MARC and Amtrak station. We recommend the Hampton Inn, but at the same time would advocate for taking a look at the Shady Grove Metro as an alternative to Greenbelt. The drawback to Greenbelt is that it is not easy to walk to the Metro from any of the hotel options and surprisingly none of the hotels offer a free shuttle to the Metro. That means travelers will need to rely on a taxi, or Parking at the station which is available for a little over $5 per day. We suggest the Hampton because rates are usually around $125 per night, this will always be much cheaper than the nearby Hampton Inn at the Silver Spring Metro. Guests can expect free parking, breakfast and wifi, plus a small gym and pool. The vast majority of reviews praise the Hampton Inn. It's a good value all around, but look at other stations first for similar priced hotels in a better location.


text:
Helen Hunter knew days like yesterday would come, when she would have to summon the courage to talk, in her quiet North Carolina way, about her late husband -- Catfish to the baseball world, Jimmy to her.
She just never thought they would come so soon.
The New York chapter of the association for amyotrophic lateral sclerosis, the disease from which Catfish Hunter died last month at the age of 53, honored him at its awards dinner at the Marriott Marquis Hotel in Manhattan. With her children, Todd, Kimberly and Paul, at her side, Helen Hunter spoke to an audience that included the former Yankees David Winfield and Reggie Jackson.
''We need to help others who have this disease, since Jimmy can't be here to help now,'' she said. ''We have to raise awareness about the disease and hopefully find a cure.''
Speaking publicly for the first time since her husband's death, Hunter said in an interview, ''We eventually knew things would progress because we read enough about it, but his progressed a lot faster than some others.''
Hunter said she chose Paul, her youngest child, to throw out the ceremonial first pitch Wednesday at Game 1 of the American League Championship Series because 20 years ago, when her husband retired from baseball, she was pregnant with Paul. LENA WILLIAMSContinue reading the main story


text:
Gift Premium Subscription To jlehew511
Join Date:09-06-2011
Last Activity:09-10-2011 11:06 PM
Posted in thread: Newbe on 09-06-2011 at 06:27 PM
It would only be used for target shooting with a couple friend that I've gone out with. I was
wantig a remington 700 but I don't want to spend that on a first gun in case I end up going 2
times a year...
Posted in thread: Newbe on 09-06-2011 at 05:03 AM
I am wanting to buy my first gun. I was wondering if anyone had any sugestions on a long range
rifle that would be good for a first gun?


text:
Error code 0x8007000d may appear in any windows operating system while updating/upgrading to next windows operating system version.Sometimes error 0x8007000d also caused by data corruption in source files which gives an error message "0x8007000d the data is invalid", and in the case of activation failures the pop-up message appear as "activation failed with exception code … Continue reading Windows 10 update error 0x8007000d data is invalid
Month: April 2017
Windows update error 80070490
Windows update error 80070490 may cause by corrupted files system of source files, internet settings issues. This windows update error code 80070490 has appeared in the following operating systems of windows. windows 7 windows 8 windows 10 windows vista Possible reason for windows update error 80070490:- There so many reasons and possibilities for windows … Continue reading Windows update error 80070490


text:
Dr. Robert Hendren MD Patient Reviews
- Urology Louisville, KY
Overall Rating
22 Patient Reviews
- Friendly Staff
- Promptness
- Wait Time 12.5 minutes
- Appropriate Followup
- Spends Time With Patients
- Bedside Manner
- Fair and Accurate Diagnosis
- Easy Appointments
Showing 1 - 12 reviews
1.0 of 5
June 12th, 2015
I waited over 2 hours in the waiting room, I don't know why I even made an appointment. This is very unprofessional
5.0 of 5
October 10th, 2013
I had an emergency lithotripsy to remove an 8 mm kidney stone. I was very impressed that Dr. Hendren visited me early in the morning to go over everything. He had a very great bedside manner. I am very impressed all around. This was an emergency situation and Baptist East referred him to me. Great choice!
5.0 of 5
October 23rd, 2012
Excellent as advertised. Came highly recommended
While no one wants to visit the doctors office I knew I needed to be seen urgently. I was quickly scheduled, seen and treated all in a matter of a few hours of my first call! Dr Hendren was more than kind and made me feel like he had all the time in the world. I can't tell you just how refreshing it was to meet and be treated by such a knowledgeable and courteous professional. I told everyone who would listen!
1.0 of 5
November 25th, 2011
Office was cooperative
My concern is with his staff.I assume that the staff reflect The doctor.I had an appointment and staff could not help me due to my debit card would not work.I called bank from his office and was told I had funds card must be damaged.They would not see me unless I paid and I explained my situation and they where not concerned.I left work and drove 2 hrs to make appointment.$25 co-pay and they refused to treat me.I tried to make arraignments to pay with check or even cash at later time so I would not mis my appointment and work.They would not accommodate me.I would not recommend this office
5.0 of 5
February 21st, 2011
Highly Recommend!
Dr Hendren is an awesome doctor & his staff is just as great! He is both my & my husbands doctor & we would not see anyone else! He definitely does what's best for his patients & still has some "old school" practices that are very appreciated! He is very dedicated to his patients & does follow up w/them after any procedure. I would recommend him to anyone w/kidney problems or needing a vasectomy...or any other problem you may have requiring you to see an urologist. A truly gifted & awesome doctor!
1.0 of 5
July 31st, 2017
5.0 of 5
March 28th, 2017
1.0 of 5
March 14th, 2017
1.0 of 5
March 14th, 2017
4.0 of 5
February 11th, 2017
4.0 of 5
February 11th, 2017
5.0 of 5
March 24th, 2016
Health Guides
Erectile Dysfunction
Get the facts about erectile dysfunction (ED), including the conditions and medications that can cause it.
more health guides
Nearby Doctors
Dr. Robert Hendren, MD is similar to these 3 Doctors near Louisville, KY.
Louisville, KY
Louisville, KY
Louisville, KY


text:
PLEASE READ: If you have problems logging in with your old password, click the Forgot Password link in the log in screen to get an email verification to request a new password or click Here. If you haven't received a new password from the forum please email your username and password to firstname.lastname@example.com. Sorry for the inconvenience.Dismiss Notice
All hotmail, msn, outlook, live email accounts are not receiving email notifications. The only way to remedy this is to add @totallyamaha.com to your safe senders list in order to receive notifications.Dismiss Notice
- Last Activity:
- Aug 16, 2017 at 12:29 AM
- Joined:
- Apr 14, 2003
- Messages:
- 1,562
- Likes Received:
- 44
- Trophy Points:
- 938
Following 4
- Location:
- Saint John, N.B.
- Occupation:
- Investment Advisor
Share This Page
Lifetime Member, from Saint John, N.B.
Lifetime VIP Member VIP Member
- Riceburner was last seen:
- Aug 16, 2017 at 12:29 AM
- Loading...
- Loading...
- Location:
- Saint John, N.B.
Sleds, Sail Boat Racing, Cars, Hunting
- Occupation:
- Investment Advisor
Signature2011 Boosted Apex XTX [ MCX 290 Turbo]
Fox Float X Reservoir Shocks, 14" Hacksaw, AEM Tru Boost controller, AEM Guages, Lake Effects Riser, Excell X Wheels, Dupont Slides
2013 Apex SE, Stock for now.


text:
Corey Gray Los Angeles, California
Pulling his inspiration from the chaotic and dream-filled world that surrounds him, Corey Gray has found his own unique way of interpreting the emotions and interactions of the universe. His love for creation pushes him further, and a passion for dreaming fuels his curiosity. ... more
Streaming and Download help


text:
Tali DovaSubscribe
- Rating: 4.90 (40) votes
- Thank you for rating this pornstar!
- You have already rated this pornstar!
- Country: N/A
- City: N/A
- Age: N/A
- Height: N/A
- Weight: N/A
- Comments: 1
Tali Dova is a hot babe. Her bio will be updated as more information becomes available.
Official Site: N/A
Tali Dova's New Albums
Albums (0)
There is no data in this list.


text: Viewing Weremilf - 2 of 5 Milftracker Pt. 2 Gary meets up with Susan, a lonely housewife. Ka-pow! Jeff McMahon February 11, 2008 2.3k Views More Info Full Credits Jeff McMahon Uploader Additional Credits Directed by Jeff McMahon, Written by Brendan McLoughlin and David Park, Starring David Park, Amanda Backensto, and Brendan McLoughlin Stats & Data 13Funny18Die 2,338 Views February 11, 2008 Published Category Not Safe For Work Parody Tags Jeff McMahon Brendan McLoughlin David Park porn Spoof Milf Up Next: Milftracker Pt. 3 AUTOPLAY Up Next In: 10 Milftracker Pt. 3 Milftracker Pt. 4 Milftracker Pt. 5 Milftracker Pt. 1 Follow Browse Related Comments Weremilf 5+ more View All ▶ 7+ more View All ▶ Jeff McMahon Vaguely Related Videos Vaguely Related Pics & Words Advertisement Tags: Jeff McMahon Brendan McLoughlin David Park porn Spoof Advertisement


text:
This week, Fiona introduces a guest blog from The Crucible actor Natalie Gavin...
If the 14-year-old you could have predicted where you are now and the route you've taken to get to the position you find yourself in, would you be surprised?
For most of us life is what happens when you're planning other things and we can often forget that the small detail of our day-to-day activity plays a huge role in shaping the direction of our future.
There are some professions that have a very set route to entry – law, medicine, accountancy etc. and there are others that don't, theatre being one of them. Very few performers have had a straightforward journey into the profession and once there the road is a bumpy one and directions can be unclear.
This week we're joined by actor Natalie Gavin, who describes her particular experience.
My journey towards becoming an actress wasn't your typical one, as I didn't particularly choose the career, it chose me. Aged 14, I had a one-hour session of drama for GCSE once a week, and I wasn't an outgoing child. I would sit at the back of the class and keep my fingers firmly crossed that I wouldn't be chosen to get up and perform. I managed to get through the majority of the year unnoticed, until eventually the teacher and the class picked me to create a five-minute improvisation on my own.
The feelings I experienced were overwhelming. I was so nervous - and clearly showing it, with butterflies in my stomach - but the more I concentrated on the task at hand, the more the butterflies turned into a ball of fire and the adrenaline ran through my whole body.
These short five minutes changed my life. I played on my nerves and created a nervous character that made the class burst into laughter. They were laughing with me not at me, and at that moment I realised I needed to feel that burning in my belly again – I knew from then on that this was what I was meant to do.
I would describe acting for me like the 'butterfly effect'. As soon as I start reading the words on the page, I slip into the character's world and everything else disappears. Through practising your craft you learn to access your self-awareness - so there's the element of being yourself at all times, but your mind and body is responding to the character.
I think this is a part of the preparation: if you can find their world then you are right to portray that role, and your next job is to convince everyone else that you have the ability to do so, with confidence. There's a porthole into the character, known as 'state of flow', and every actor will have a different way of entering it. Whilst playing Mary Warren in The Crucible, I had a few different rituals that I needed to carry out in order to feel completely confident in portraying her character.
For example, I would push the wall with full force for as long as I could to feel grounded, but also dishevelled and weak. I would lie down backstage and listen to the scene before, to feel the atmosphere before entering. I would also crawl on my bare knees to collect my poppet and take the needle out and start to sew.
This must have seemed mad to the people backstage, but I recall them telling me that they found it fascinating to watch all the actors having completely different rituals they had to complete to feel in character. I believe that I did carry Mary Warren around with me. The lady that I lived with witnessed me experiencing all types of different emotions after the show - I could come in and burst into tears, and other days feeling relief, both emotions I portrayed on stage minutes earlier.
Today we publish the transcript of our interview with Natalie, who goes into greater detail about taking on Arthur Miller's huge play and how her very practical approach grounded her and gave her confidence.


text:
Mercedes has revealed the exterior of the upcoming E-Class in a video which sees it being driven alongside a C-Class and a S-Class on the streets of Las Vegas. The car still sports a camo paint job along with the letters CES emblazoned on its side, referring to the Consumer Electronics Show that is currently taking place in Las Vegas.
Also Read: Mercedes E-Class Images Leak Out Ahead Of Detroit Debut
Connect with the Author on Twitter @DennisA_James


text:
Unaccompanied Refugee Minor Program
CCC provides foster care through our Unaccompanied Refugee Minor Program to refugee children who have fled their home countries because of war, persecution or other dangerous living situations. These children arrive in the U.S. through the United Nations, but they either arrive without their families or their families are unable to care for them. The children are placed in a foster home where they receive support from their foster family and social workers to help them adjust to their new lives in the U.S.
In Richmond call 804.545.5949
In Roanoke call 540.342.0411
In Norton call 276.679.1195


text:
What is JotForm?
JotForm is a free online form builder which helps you create online forms without writing a single line of code. No sign-up required.
At JotForm, we want to make sure that you're getting the online form builder help that you need. Our friendly customer support team is available 24/7.
We believe that if one user has a question, there could be more users who may have the same question. This is why many of our support forum threads are public and available to be searched and viewed. If you'd like help immediately, feel free to search for a similar question, or submit your question or concern.
Do you have a calendar option that would track dates of events?Asked by asmithybc on December 20, 2016 at 07:26 AM
We are looking to do a trackable calendar for some of our vendors. I need it to be something they can log in to and view other dates that are taken and dates that area available for them to participate in events at our store locations.
JotForm Support
Hi there,
We have the following widget that are maybe related to your requirement.
However, if you are looking for a full-featured calendar like Google Calendar, it is not yet possible with JotForm.
You may also loot at our Calendar Report and see if that suits your requirement.
Let us know if you need further assistance.


text:
1501 15th Street, San Diego, CA 92101Request info Add to list
To view building contacts please sign in with your Pro account or create a pro account.
Matt C.
Company: requires Pro account
Email: requires Pro account
Phone: requires Pro account
- Available Spaces
|Space Type
|Office Space
|For lease: Negotiable
|206,000 sqft
BLOCK A 206,000 square feet office 250 residential units 90,000 square feet retail Arguably the most desirable space of the project, BLOCK A... show more »View Details
Building Details:
1501 15th Street is an office property for lease in San Diego, CA. The property currently has 1 office space for lease and is marketed by CBRE San Diego.
Request Property Information
Please describe your commercial real estate requirements. We'll create a list of matching properties that meet your criteria.
- Scott Warner, agent and Rofo Pro


text:
Met a lovely guy through friends, and he asked me out for a drink. I then discovered he came out of a ten year relationship only a few months ago. I myself, broke up with my ex boyfriend of four years in February but I'm ready to move on and find another potential boyfriend. We're both 25, so I'm guessing his ex was a high-school sweetheart. She's now dating a guy in his 40's at her place of work. Anyway, we're both in similar places. My ex was my longest relationship, we got together at 21 and was my first love. I'm not about to rush anything with a guy, as I'm looking for potential commitment in the future. Any tips?
I'm going on a date with a guy whose come out of a 10 year relationship! How do I handle this?
What Guys Said 1
Have sex with him on first date. At least a blowjob in the car. You will lock him in for a long time relationship.00|01|0
Your wife's job at hooters must pay well for your 10 kids on welfare ;)
I'm giving you good advice. Take it or don't.
I appreciate good sarcasm... Only when it's done right
What Girls Said 2
Don't think too much about it. At least you know that he's capable of holding a long term relationship, so that potential commitment thing shouldn't be an issue. A lot of times, especially in relationships that have lasted that long but have ended, the last few months/years might have been dragged out because neither wanted to break it off, but they really weren't invested in it anymore. Like you said, you were able to move on from a few years long relationship in a few months, and he might be at that place too. Sometimes you know when a relationship is already over, even if you haven't officially broken it off. Treat it like a normal date. Ask whatever questions you need (without being too prodding or nosy), but you'll see soon enough whether or not he's ready to date.00|00|0
Thanks, yeah I'm probably overthinking it! I've been dating a few months and it's been a bit foreign and its screwed me over a few times. The last year in my last relationship just dragged, and we felt more like friends than a couple X
yea exactly. that might have happened with him as well, you never know. so there's a good possibility he's not emotionally attached (and might not have been for a while) anymore.
All I can say is go into it with caution and go slowly. Also try not to overthink things, it's your first date and pretty much anything can happen. Nothing is set in stone and there's not a guarantee you'll even be all that interested in each other. So just see what happens and how he is. I think you might be getting a bit too ahead of yourself.00|00|0
Thanks for the advice, I need to stop overthinking it aha
Learn more
Select as Most Helpful Opinion?
You cannot undo this action. The opinion owner is going to be notified and earn 7 XPER points.


text:
Hi, I have upgraded some users from Outlook Express to Outlook 2003 (sp3).
I've tried to archive their mails which are older than 2008, (which I can clearly see that they do exist) to archive.pst file. But for some reason, as it looks like its archiving, it creates an archive.pst file with 265 Kb size but, does not move the old mails to archive.
What may be the problem ? Or is this a bug ?
6 Replies
Dec 27, 2009 at 11:16 UTC
You don't say whether or not you imported all of the messages first into Outlook, but that is one thing you need to do. Where is the archive.pst file? Did you add the Archive.pst file to your Outlook profile? If not, add it and check it for the emails. If you add it to the profile and cannot see the emails, try the archive process again with the archive.pst file attached to your Outlook profile and it should work.
Dec 28, 2009 at 12:16 UTC
I'm sorry but your answer is not related to the topic.
This is about Outlook not archiving newly imported data to "outlook 2003".
Dec 28, 2009 at 2:47 UTC
OK, as I read the forums over the net, I think this matter is related to that Outlook actually archives the mail not according to the send or received dates, but according to the "modified date" field which can be seen by setting the column.
As I have upgraded recently from OE to Outlook 2003, all messages seemed to be modified very recent.
The only reasonable work around is to find some third party software which may be able to set automatically the modified dates to the sent or received dates.
I'm currently checking on ArchiveAssist software that says to help.
Any tips would be appreciated.
Dec 28, 2009 at 10:26 UTC
ArchiveAssist will work - sometimes.
You pretty much have to use it before you import the messages into the store.
The biggest annoyance is that Outlook will touch the modified date for all sorts of dumb reasons.
If you are using OWA, that throws things off a bit as well - best I can tell is that it uses the date-that-used-to-be-the-modified-date-but-is-not-really-related-to-anything-anymore field.
For archiving, I find that what works best is manual archiving, as you are then selecting messages based on a visible, rather than hidden, parameter.
Aid4Mail is good for extracting the individual messages from a pst file.
The method that worked with my most ornery boxes when I was importing them was to use Outlook to create a local copy of the full messages, then Aid4Mail to extract them, ArchiveAssist to verify/correct Modified date, then Tbird to copy them to the message store.
I did not get very far using the Exchange Management Console to import anything, as when run from a 64 bit box, it can't import from pst files, and I don't have a 32 bit os local to that vm.
Dec 28, 2009 at 11:23 UTC
You can set up a rule to move the older emails to the archive.pst file or any other pst file you would like to.
Dec 28, 2009 at 12:08 UTC
I had a problem with Outlook 2007 archives not archiving at all and it had alot to do with an imported archive.pst file. I solved the problem by creating a brand new archive.pst file in Outlook by going to the options menu under Archive and choosing a new name for the archive.pst file (such as archive2.pst) and then manually selecting the archive option from the File menu.
This gave me two archive folders in Outlook. The next step was to manually copy the contents of the old archive folder to the new one. To do this, I selected all of the e-mails from the old archive folder, cut it, and pasted it to the new archive folder. This step took all of 2 minutes.
This discussion has been inactive for over a year.
You may get a better answer to your question by starting a new discussion.


text:
From rides around the neighborhood to quick errand runs, the E-Z-GO Freedom RXV is designed to help you enhance your lifestyle. Choose between the electric model's patented AC drive and the low-emission, 13.5-hp gas-powered model. No matter where the day takes you, let the Freedom RXV get you there.
US MSRP $7,299 (Electric) | $7,199 (Gas)
Audio & Entertainment
Brush Guards
Enclosure (2 Passenger)
Golf Course Accessories
Lift Kits
Light Kits
Seat Kits
Tires & Wheels
Top Kits (54" Tops)


text:
Author | exchange4media Kolkata Bureau | Saturday, Jan 08,2005 8:23 AM
The dynamics of the world economy is set for a change – with new trade policies and business practices, powered by increasingly sophisticated technology and rapidly adjusting competition, gathering momentum, traditional system of business and predictable developments have taken a backseat. For India, the changing dynamics throws up the challenge to translate the huge workforce lying unutilised in our country into potential drivers of economy.
Indian Institute of Management, Calcutta hosted 'Intaglio 2005' as an attempt to inspire the business leaders of tomorrow to look for avenues that can transform such opportunities into engines of our economy's growth.
The fourth annual chapter of the event began on Friday with the theme – 'Excelling at Managing Change' and attracted scholars and business executives from all over the world. Drawing on the insights and perspectives of a diverse group of participants, the event tries to demonstrate, debate, and comment upon the relevant issues shaping the economy in times to come.
Speakers at the event include some of the chieftains of corporate India and opinion makers for business and economy. And, topping the agenda at Intaglio 2005, stands the lecture series 'Reverberations', where profound insights are shared by celebrated personalities on what lies ahead for organisations in this ever-changing business environment.
Leading off the discussions, Dr Omkar Goswami, former Chief Economist of the Confederation of Indian Industry and consultant to institutions like the World Bank, the IMF, Asian Development Bank and the OECD, said, "The companies must rethink and revolutionise how they do business in India, because most of the potential market lies in the rural sector and is still untapped."
Speakers like Ajit Balakrishnan of Rediff, Mohanbir Sawhney from Kellogg School of Business and many more would also be voicing their viewpoints at the event. In addition, famed quizmaster Siddharth Basu would be hosting the Business Quiz.
The participant squad includes corporates like, Barclays Capital and State Bank of India as sponsors. With an optimistic outlook, many others corporate houses are also making their presence felt at the event.
However, the event has always been unusual because of its combination of visionary speakers and various interesting competitions; but the student body at the institution claims that Intaglio 2005 format is such that it shall add to the illustrious history of the festival.
Programming HeadRadio Mango


text:
IGN recently was on the set of Godzilla (2014 film) and gave us more information on the film.
Here is the article: http://www.ign.com/articles/2014/03/19/5-things-godzilla-wants-you-to-know-and-3-he-doesnt
Here is a quote from an interesting passage:
As we've seen in the trailers, as well as the image above, Godzilla 2014 makes reference to the monster's existence in 1954. There are flashbacks of the military setting off atomic bombs in an attempt to kill him, as well as present day scenes featuring his colossal bones. Yet, as Edwards told us on set, their movie is functioning as an origin story. If this film was following the events of the original precisely, and Godzilla had invaded Japan, then the world would know about his existence...They don't.
So... the bones on the beach where Godzilla's? Hmmmm.
Here is something Gareth Edwards said about locations: "It felt like what we were doing with the franchise was taking something that was very Japanese, that belongs to Japan, and bringing it to America," the director explained. "And so from a very early stage, the journey of this movie was a journey from Japan to America. That felt like the heart of everything. Hawaii's in the middle of it, obviously. So we sculpted the story around that basic, global path. And it's not as literal as 'something from Japan comes to America.' But it felt like visually we wanted that transition to happen from a feeling of a very Japanese thing to become an American thing."
To all those fan boys mad about it not taking place in Japan, don't worry, there's enough for everyone.
Eagle-eyed viewers have already started to point out potential Easter eggs in the teasers and subsequent marketing materials. There's been speculation that the Mothra twins made an appearance in the most recent trailer, though that's been denied.
Sorry about that.
Was it Rodan ?
Nope! Savvy King Kaiju-lovers, like our very own Daemon Hatfield and Jared Petty, have been keeping a keen eye out, and spotted what looked to be a monster in the sky in the most recent trailer. Many wondered if it wasn't Godzilla's winged foe Rodan (take a look at our second rewind theater below for a closer look and some great analysis from Jared and Daemon). No, it was not Rodan, nor any other classic Godzilla creature, but it was another kaiju.
Here's what we do know: When we asked about the design of the creatures, we were told that there was a little more freedom with the M.U.T.O.s, as they were a "military experiment" in this world. Yet, the team went through many more design phases with these creatures, as they had the classic look to draw upon for Godzilla. With the M.U.T.O.s idea was to create something unlike anything we'd ever seen before, but that still had biological integrity.
So i was right about the Mutos.
Of course producers haven't confirmed plans for a sequel - yet. However, Tull did say that if they were fortunate enough, they "certainly have a lot more to say on the subject."
We're very focused right now on making sure audiences love this movie," he continued when asked if we might ever see any of the other classic Toho creatures. "We're certainly going to work with Gareth Edwards again. Whatever direction that story took, we'd be openminded to any of it. We have a great relationship with Toho. I can't think of anything more fun than being in this universe that's been created."
So, perhaps we'll see Rodan after all.
I hope so.
What do you think, tell me below.


text:
Attention Landlords! Should You Furnish Your Rental Property?
This is one of several important questions a property owner has to answer. In order to come up with a thoughtful answer, a whole set of new questions must be pondered.
What are my ideal rental terms?
Some property owners are looking for tenants who will stick around for years. Others, like those who own vacation properties, exclusively rent out their space to people who only plan on staying for a couple of months. If you're targeting the short-term market, furnishing your place could be an ideal way to generate repeat business and profit nicely from charing a premium monthly rate.
How will I handle maintenance?
You start to look at furniture in a different light when it's an asset you're for responsible for maintaining. You need to think long and hard about whether your investment in furnishings is justified based on potential damage and wear and tear amid usage. In this case, it would be wise to incorporate a clause that specifically holds the tenant liable for damage to certain items in the lease agreement.
Can you make it worth it?
The potential to pocket more money is one of the most compelling aspects of offering a furnished rental property. It's much easier to command higher rates when you're sparing tenants the hassle of buying furniture, appliances, and other household essentials. However, the value those furnishings add will be influenced by things like the décor, architecture, and surrounding community.
Can you afford it?
A furnished rental property is another expense added to your existing investment in real estate. If you decide to go this route, yet can't afford to buy the pieces you need, renting furniture can be an ideal alternative route. Rental furniture accommodates a broad range of furnishing needs by providing easy access to living room, dining room, and bedroom pieces, in addition to appliances electronics, and other items. A diverse selection allows you to cover the basics and add special features like flat panel TVs that further increase the property's rental value.
If renting furniture and accessories sounds appealing, Buddy's Home Furnishings can be of assistance. Check out our website at BuddyRents.com to view an assortment of pieces that might fit your rental property furnishing needs.


text:
Designed to firmly hold cell phones, eyeglasses, PDAs, MP3 players, plus more! Keep your essentials close-at-hand instead of on the car floor.
- Non-adhesive, no magnets
- Leaves no sticky residue
- Edges don't curl, even after long exposure to heat and sun
- Lasts for years. Wash to renew grip


text:
Touch Screen Phones
Get more from your phone with an innovatively designed LG touch screen phone. Choose from an array of sleek, stylish devices that offer you a more advanced handset, touch screen technology and exclusive features. It's all just a touch away
LG Product Service and Support
Get your questions answered about product setup, use and care, repair and maintenance issues. We can help.
Call an LG Support Representative on
Kenya :0800-545454
Uganda :0800-205454
Tanzania :0800-785454
Monday to Friday : 8AM to 5PM
Saturday : 8AM to 1PM
Except national holidays
Call us Toll-free


text:
The Boone County INGenWeb web site at this address is undergoing reconstruction.
For the time being, please go to our Rootsweb INGenWeb web site to view Boone County's information.
If you can't find the information you're looking for send an email to firstname.lastname@example.com
County Coordinator - Darlene Anderson
State Coordinator - John Peck
Asst. State Coordinator - Lena Harper
Asst. State Coordinator - Debbie Beheler


text:
I have a user who is having a problem, she constantly keeps getting disconnected and reconnected again. I have recreated her user profile, I have reloaded her laptop again with Windows 7 and reinstalled with MS Office 2010 but she keeps having the same issue, this is not happening to anyone else in the building it is only this user,
Any IDEAS??
4 Replies
Oct 11, 2011 at 5:23 UTC
Does she have a large number of shared folders/additional mailbox in her account?
Exchange only allows a certain number of connections from each client, each additional mailbox/shared folder will open more connections and if the limit is reached then Exchange will start closing connections which could result in Outlook being disconnected briefly.
Oct 11, 2011 at 6:19 UTC
You say connected and disconnected....but from what? Are talking about wireless Internet connection? cable?
Or are we sure that the internet connection is stable...and then outlook freezes or doesnt respond? Guys...maybe the problem here is not with the emails...????
Need to take things here step by step.....1st check the following in order...
1. What kind of connection is she using? Cable, or wireless?
2. Is the actually internet connection dropping? and then reconnecting showing a red X sign? Does she know how to detect this? or is she clueless in IT....means you have to sit on the computer and see the problem happen in front of your own eyes.
3. Is this problem only affecting Outlook? or even Internet Explorer and web browsing?
Maybe her laptop is just messed up like everyone else i know and needs a bit of maintenance...
Advanced System care: (free)
System Mechanic: (free for 30 days, after it does the job, u can uninstall it)
Usually after running these two above programs...i find that they solve ALOT of problems....slow pc....freezing.....internet connection speed.....etc....
Give it a try...i have a feeling the problem is not with Exchange...but her laptop itself...?
Oct 11, 2011 at 8:19 UTC
If you have reloaded windows 7 and office 2010, as well as recreating profile then it doesn't necessarily sound like this is for sure an outlook issue. Have you checked event logs on local machine and the exchange server to see if there is any extra information?
I would also follow Dave8990's advice on checking the connection... If its a reload of windows do you have updated drivers, all service packs, etc.
If this is only happening to this single user, what is different about her setup than everyone else? Is hers a newer machine? Is she running any applications that may be opening extra MAPI session on the server causing her to hit the exchange session limit?
Check the antivirus settings, as well as firewall...
The only other things to try and see; would be to fiddle with cache-mode, and see what the size of her ost/mailbox is....This may sound crazy too, but see how "crazy" her calendar is setup, i.e. does she have a bunch of appointments that are scheduled to reoccur to infinity. I have seen that tear up many an outlook on newer win 7 machines.
If you press "ctrl" key and right-click on the outlook icon, you can get the "connection status" menu, see what its saying there when it disconnects...
Oct 11, 2011 at 8:22 UTC
One more thing, you didn't say if she is connecting wired or wireless...if she is wireless, what is the possibility that she is "roaming" to a different wireless network during the course of the day?
This discussion has been inactive for over a year.
You may get a better answer to your question by starting a new discussion.


text:
I would like to hire an Unity 3D Developer
Budget $750-1500 USD
2D 8 Bit styled art. MMORPG, Building creation, economy, resource management, Border claiming, Sword of mana styled combat.
33 freelance ont fait une offre moyenne de 1893 $ pour ce travail
Greetings!! Thanks for posting the wonderful job opportunity. I have 6 years experience in the GAMES INDUSTRY, working on freelance projects and building my own games. I am highly competent in all stages of gam Plus
hi how are you. i read your bid carefully. i have interest your project. i have developed unity game & app for 5 years. i had ever developed game with unity 3D. please contact me. kindly regards. thanks. htt Plus
Greetings, I am very thankful for this opportunity. It's really exciting that we have below similar kind of expertise and work experience: https://play.google.com/store/apps/details?id=com.digital.game.subway h Plus
Hello, Thanks for giving us an opportunity to place a bid. A game that focuses on skillful thinking and planning to achieve victory. It emphasizes strategic, tactical, logistical challenges, turn-based or real-ti Plus
Hi, I am an expert Unity3D developer. Quick questions to start with: 1.Do you have storyboard of the game you want to develop? 2. Do you have the design frames for the game? Please share further details of the Plus
hello,how are you. i read your bid carefully. i am Unity3D expert and have full experience for 8 years. Unity3D is my top skill and passision. you can reference these urls showing demos i developed. https://itunes. Plus
Hi there I can help you with the 2D 8 Bit styled art game in unity. I can develop the game with art and code. I have good hand on experience with the unity and can help you on this. Check my profile for reviews a Plus
Hello, I'm Claudio, head of Blumer Solutions, a software factory based on Buenos Aires - Argentina. We are a team of Software Engineers, UI/UX experts, 2D/3D artists and QAs. We combine the engineering and technical r Plus
Hello sir,i am ready to start work well and have done lot of games and applications in unity3d . https://play.google.com/store/apps/details?id=com.parrox.Parrox https://play.google.com/store/apps/details?id=com.TJ. Plus
Hi, Unity 3D https://play.google.com/store/apps/details?id=com.virtualinfocom.buroangla&hl=en (Adventure Hero) https://play.google.com/store/apps/details?id=com.virtualinfocom.racing3dcars (X Gear) https://play.g Plus
Hello, Hope you are doing great ! As per your requirement We have sound knowledge of unity and we will complete this task in few days. We are a team of 30+ game developers and designers and have all the skills re Plus
https://drive.google.com/open?id=0B-axQXH6TXvKbUJDUFlvcXZzS0k (MMORPG) https://www.dropbox.com/s/a9uzfp5y9bizcib/KDBWG20160601.apk?dl=0 https://itunes.apple.com/us/app/kou-dai-bo-wu-guan/id1075778424?mt=8 Plus
Hello Sir, First of all, we would like to tell you how we will initialize the project with you Please have a look at our portfolio for Mobile App and Unity Game based projects: https://drive.google.com/open?id=0B4F8 Plus
Hello How are you. If you're interested in top quality work and communication please read on! You can feel free to check out my portfolio available through my freelancer profile. My portfolio is very in depth and sho Plus


text:
Would You Make a Good Leader?
10 Questions - Developed by: Harrison - Developed on: - 99.585 taken - User Rating: 3.65 of 5.0 - 80 Votes
This is a test to see if you would make a good leader. If you are, YOU decide what to do with your skills!
Is there a new comment? / refresh page
I knew it I knew I was a great leader. Thank you. :) :) :)


text:
Dienhart's Diary: Next best thing to being on the bus
BTN.com senior writer Tom Dienhart is trying something new this year on our annual football tour. At each of the 14 practices across Big Ten country, Dienhart will pen a quick diary post. From Indiana, the first stop, to Illinois, the 14th and final stop, our expert will provide plenty of fun behind-the-scenes updates. Get our latest football tour coverage: AUG. 18: NEBRASKA Bus tracker: Minneapolis to Lincoln – 430 miles (2,923) Lincoln, Neb., is one of my top stops. I love the passion of the community. In fact, I don't think any Big Ten school can top the fevered mania


text:
Friday 6 July 1945
It was Friday, under the sign of Cancer. The US president was Harry S. Truman (Democratic).
Famous people born on this day include Rik Elswit and Burt Ward in Los Angeles.
The Silver Fleet, directed by Vernon Campbell Sewell, was one of the most viewed movies released in 1945
But much more happened that day: find out below..
You can also have a look at the whole 1945 or at July 06 across the years.
Old Newspapers
Have a look at the old newspapers from 6 July 1945 and get them!
Which were the most popular movies released in the last 30 days ?
Find out your future
Get a FREE Numerology report based on the digits of 6 July 1945!
Wish him/her..
Historical Events
Which were the important events of 6 July 1945 ?
- Comoros - Independence Day (1975).
- Feast day of St Maria Goretti.
- Lithuania - Statehood Day.
- Malawi - Independence Day (1964).
- Malawi - Republic Day (1966).
- Roman festivals: Ludi Apollinares, games in honour of Apollo (since 208 BC) began today.
- San Fermin a Spanish Catholic festival centered in Pamplona begins today.
- Music festival EXIT begins today in Serbian town of Novi Sad.
- Czech Republic - Jan Hus Day (1415).
Famous Birthdays:
- Rik Elswit: Rocker (Dr Hook & Medicine Show-In the Right Place).
- Burt Ward in Los Angeles: California, USA; actor (Robin - Batman).
- Rodney Matthews: English fantasy artist and illustrator.
- Andy Anderson: American athlete, played pro basketball for three seasons beginning in 1967.
- Burt Ward: TV Actor.
- President Truman signs executive order establishing Medal of Freedom
- Washingston Senator Rick Ferrell catches a record 1,722 games
- Nicaragua becomes first nation to formally accept United Nations Charter.
- US President Harry S. Truman issues an executive order establishing the Medal of Freedom.
Music Charts
Which were the top hits in that special week of July 1945 ?
Top #5 songs in the USA
- Can't You Read Between the Lines? - Jimmy Dorsey & His Orchestra
- Tain't Me - Les Brown & His Orchestra (Vocal Doris Day)
- Chopin's Polonaise - Carmen Cavallaro & His Orchestra
- Sentimental Journey - Merry Macs
- Who Threw the Whiskey in the Well? - Lucky Millinder & His Orchestra
Search For Your Ancestors
Subscribe to our Newsletter
Don't miss our monthly news, no spam guarantee Click here to Subscribe
...and if 6 July 1945 was your Birth Date then Join our Birthday Club!
Make this date unforgettable
Genealogy: find out your family heritage
Which were the most popular books released in the last weeks ?
Remember when
What videogames would you be playing back in the days ?


text:
Ayurvedic Supplements Blogs
Sandhu Herbal Products - A blog to provide various information about Ayurvedic herbs and supplements.. which helps in maintaining better life and health. Follow the blog and get updates about the benefit.. of herbs.
Owner: sherbalproducts
Listed in: Health
Other Tags: ayurvedic herbs, ayurveda, herbal products, herbal supplements