text:
This article has multiple issues. Please help improve the article or discuss these issues on the talk page.
The Treaty of Hudaybiyyah (Arabic: صلح الحديبية) is the treaty that took place between the state of Medina and the Quraishi tribe of Mecca in March 628CE (corresponding to Dhu al-Qi'dah, 6 AH) [1].
|This section requires expansion.
In 628 AD, a group of 1,400 Muslims marched towards Mecca, in an attempt to perform the Umrah (small pilgrimage). The group was prepared with animals of sacrifice, as they hoped that the Quraish would honour the Arabian custom of allowing unarmed pilgrims to enter the city. According to Lewis, Muhammad felt strong enough to attempt an attack on Mecca, but on the way it became clear that the attempt was premature and the expedition was converted into a peaceful pilgrimage.[2] Andrae disagrees, writing that the Muslim state of ihram (which restricted their freedom of action) and the paucity of arms carried indicated that the pilgrimage was always intended to be pacific.[3] The Quraish intercepted the Muslim party well outside Mecca. By this time, all of Arabia was aware of the military strength of the Muslims. Muhammad wanted to avoid bloodshed in or near the holiest city of Islam. He said: (Bukhari B3V50H891)
- We have not come to fight anyone, but to perform the 'Umra. No doubt, the war has weakened Quraish and they have suffered great losses, so if they wish, I will conclude a truce with them, during which they should refrain from interfering between me and the people, and if I have victory over those infidels, Quraish will have the option to embrace Islam as the other people do, if they wish; they will at least get strong enough to fight. But if they do not accept the truce, by Allah in Whose Hands my life is, I will fight with them defending my Cause till I get killed, but (I am sure) Allah will definitely make His Cause victorious.
The two parties decided to resolve the matter through diplomacy rather than warfare. Hence the Quranic reference to the Sakina or Spirit of Peace. "He it is Who sent down the sakina into the hearts of the believers that they might add faith unto their faith" (48:4).
A treaty was drawn up.
The outline of the treaty was as follows:
In the name of almighty Allah. These are the conditions of Peace between Muhammad(saww), son of Abdullah and Suhayl ibn Amr the envoy of Mecca. There will be no fighting for ten years. Anyone who wishes to join Muhammad (saw) and to enter into any agreement with him is free to do so. Anyone who wishes to join the Quraish and to enter into any agreement with them is free to do so. A young man, or one whose father is alive, if he goes to Muhammad (saww) without permission from his father or guardian, will be returned to his father or guardian. But if anyone goes to the Quraish, he will not be returned. This year Muhammad (saww) will go back without entering Mecca. But next year he and his followers can enter Mecca, spend three days, perform the circuit. During these three days the Quraish will withdraw to the surrounding hills. When Muhammad and his followers enter into Mecca, they will be unarmed except for sheathed swords which wayfarers in Arabia always have with them. (Sahih Muslim 19:4401)
The treaty was quite controversial for many reasons. Originally, the treaty referred to Muhammad as the Messenger of God which was unacceptable to the Quraish ambassador Suhayl ibn Amr. Muhammad ordered Ali to strike it out, but Ali replied that he would not as it would be false, after which Muhammad himself rubbed out the words. (Sahih Bukhari 3:49:62, Sahih Muslim 19:4404).
The Muslims objected over a clause of the treaty that said that any citizen from Mecca entering Medina is eligible to be returned back to Mecca (if they want), while any Muslim from Medina entering Mecca is not eligible to be returned to the Muslims, even if Muhammad requested. (Sahih Bukhari 3:50:874)
After the signing of the treaty, there was still great fury among the Muslims because they did not like the stipulations of the treaty. Muhammad, binding onto the Islamic ethic "fulfill every promise" ordered that Muslims do exactly as the treaty says. A few Muslims, especially Umar bin Khattab, strongly objected to the treaty, and even went on as far as regarding Muhammad's decision to be wrong. Many Muslims thereafter objected, when Muhammad told them (thrice) to perform their rites there and then. (Sahih Bukhari 3:50:891)
Muhammad insisted that Muslims had been victorious and was supported in this by new revelation: "Verily we have granted thee a manifest victory" (Qur'an 48:1). He promised much spoils in the near future: "...and He sent down peace of reassurance on them, and hath rewarded them with a near victory, and much booty that they will capture". (Qur'an 48:18-19)
The treaty's stipulations on the movement of persons gave rise to later controversy, when the Quraysh woman Um Cultum went to Medina and joined the Muslims, and her brothers demanded her return from Muhammad, as they interpreted the treaty to mean. Muslim commentator Abdullah Yusuf Ali considers that the treaty had already been violated, probably by an attack by the Quraysh-allied tribe of Banu Bakr upon the Muslim tribe of Banu Khuza'a. Thus he believed that divine instruction was needed on what was to be done with migrants from Mecca.[4] Other Muslim sources state that the treaty's restrictions only applied to free men, and not to slaves or women.[5] Ultimately, Muhammad refused on the basis of revelation from God: "When there come to you believing women refugees, examine and test them... if ye ascertain they are believers, send them not to the unbelievers" (Qur'an 60:10). If the woman married a Muslim, the Muslims would pay the Meccan refugee's ex-husband a sum equal to the dower he had paid upon marriage to her". (Qur'an 6:10)
In 629 AD, the Muslims made The first pilgrimage. Two years later, in 630 AD, there was a skirmish between the Bedouin tribe of Khuza'a and the Banu Bakr tribe which was an ally of the Quraysh; this was a breach of the treaty as one of the clauses of the treaty was that "an attack on an ally of the party, will be considered an attack on the party itself". Muhammad offered the Quraish three alternatives:
- Dissolve their alliance with the Banu Bakr
- Compensate by paying blood money
- Dissolve the treaty
The Quraish chose the third alternative. Thus, Muhammad was left with "no alternative" but march on to Mecca. With the 10,000 men of his army, he marched on to Mecca where he ordered his troops not to harm women, children, old people, those who surrender, those who are sick, those who are weak, not to destroy houses, and destroy trees or gardens. Thus, there was no bloodshed in the conquest of Mecca.
Islam spread widely and quickly during the two years that the treaty was in effect. While Muhammad had 1,400 followers when he signed the treaty in Hudaybiyya, he had well over 10,000 for his conquest of Mecca two years later.
See also
- ↑ Tafsir ibn Kathir This treaty establishes a ten year peace and allows Muhammad to come into Mecca during pilgrimage for the rest of his life. [1]
- ↑ Lewis (2002), p. 42.
- ↑ Andrae; Menzel (1960) p. 156; See also: Watt (1964) p. 183
- ↑ A. Yusuf Ali. Holy Qur'an, Text, Translation and Commentary. 1934: Ripon Press, Lahore. p1390,p1534.
- ↑ Sh. Sh. Safi ur-Rahman Al-Mubarakfuri. "Al-Hudaibiyah Treaty." http://www.islaam.com/Article.aspx?id=461
- The Oxford History of Islam by John Esposito (Oxford U. Press, 1999)
- Kitab al-Tabaqat al-Kabir
- Sirat Rasul Allah
- Bukhariar:صلح الحديبية
ca:Tractat d'al-Hudaybiyyafa:صلح حدیبیهid:Perjanjian Hudaibiyyahms:Perjanjian Hudaibiyah ja:フダイビーヤの和議 pt:Tratado de Hudaybiyah tr:Hudeybiye Antlaşması ur:صلح حدیبیہ


text:
James and the Rescue Train is a board book written by the Reverend W. Awdry and illustrated by Ken Stott.
One day, James was taking some trucks to the yard when they started pushing him. Soon, James crashed into a field. The guard ran for help and soon Thomas came with the Breakdown Train. He rescued James, and soon James got repaired.
- This book is based on the first season episode, Thomas and the Breakdown Train.
- On the front cover, James has circular cab windows, and is also missing his handrail, and in addition, his wheel arch and tender lining is yellow.
- The Troublesome Trucks are missing their faces.
- James is missing his eyebrows and whistle in the 1st illustration.
- James' pony truck wheels are grey.
- In the 9th and 11th illustrations, James has buffers on his back cab.
- James looks happy when he first gets pushed by the Trucks.
- The rails don't have spikes.
- Thomas and James are missing their brake pipes and lamp irons.

subset: commoncrawl


text:
With First Tutors: Music you can find a Alloa oboe teacher. Oboe tuition are an excellent method to learn a fun new hobby, pick up a new skill and attain confidence in oboe. Please use our service to search for Alloa oboe tutors and determine which matches your needs so you can enjoy your oboe lessons in Alloa immediately!
First Tutors: Music is the fastest way to locate Alloa oboe tutors in the UK, helping you find Alloa oboe lessons close to you and Alloa tutors to assist with any instrument such as piano, violin or guitar. We can help you find Alloa oboe lessons or a one-to-one Alloa oboe teacher to prepare for oboe exams and develop your oboe skills! We order Alloa oboe tutors in your area by their hourly charges and proximity to you.
If you are a oboe tutor and would like to offer your oboe tuition services in Alloa or throughout the UK, please register with First Tutors: Music or find out more about us here. Becoming a Alloa oboe tutor is a brilliant way to re-affirm your own knowledge through providing oboe lessons while assisting someone else, all in your local Alloa area!


text:
Remembered sets can also play cards
- Alexina Morgan
- 2 years ago
- Views:
1 Remembered sets can also play cards Antony L. Hosking Richard L. Hudson Object Systems Laboratory Department of Computer Science University of Massachusetts Amherst, MA Abstract Remembered sets and dirty bits have been proposed as alternative implementations of the write barrier for garbage collection. There are advantages to both approaches. Dirty bits can be efficiently maintained with minimal, bounded overhead per store operation, while remembered sets concisely, and accurately record the necessary information. Here we present evidence to show that hybrids can combine the virtues of both schemes and offer competitive performance. Moreover, we argue that a hybrid can better avoid the devils that are the downfall of the separate alternatives. 1 Introduction Generational garbage collectors [6, 10, 11] achieve short pause times partly because they separate heap-allocated objects into two or more generations and do not process all generations during each collection. Empirical studies have shown that in many programs most objects die young, so separating objects by age and focusing collection effort on the younger generations is a popular strategy. However, any collection scheme that processes only a small portion of the heap must somehow know or discover all pointers outside the collected area that refer to objects within the collected area. Since the areas not collected are generally assumed to be large, most generational collectors employ some sort of pointer tracking scheme, to avoid scanning the uncollected areas. Again, empirical studies show that in many programs, the older-to-younger pointers of interest to generational collection are rare, so avoiding scanning presumably improves performance. This is intuitively explained by the fact that newly allocated objects can only be immediately initialized to point to pre-existing (i.e., older) objects. Pointers from older generations to younger generations can be created only through assignment to pre-existing objects. Detecting such This work is supported by National Science Foundation Grants CCR and CCR , Digital Equipment Corporation s Western Research Laboratory and Systems Research Center, and Sun Microsystems. assignments requires special action at every pointer assignment to see whether that pointer must now be considered by the garbage collector when collecting the younger generations. This special action constitutes an extra hurdle at every site in the program that might write a pointer into an object, hence the term write barrier. A number of schemes have been suggested for generating and maintaining the older-to-youngerpointer information needed by generational collectors, including special-purpose hardware support [10, 11] and generation by compilers of the necessary inline code to perform the checks in software [2] (adding to the overhead of pointer stores). Ungar [10, 11] uses remembered sets to maintain the necessary information on a per-generation basis, recording the objects in older generations that may contain pointers into the generation. The garbage collector examines all the objects recorded in the remembered sets of the younger generations being collected to determine the live (i.e., reachable) objects. Alternatively, dirty bits can be maintained for older generations indicating whether the generation contains pointers to objects in younger generations. The heap is divided into aligned logical regions of size 2 k bytes the address of the first byte in the region will have k low bits zero. These regions are called cards [9, 12]. Each card has a corresponding entry in a table indicating whether the card might contain a pointer of interest to the garbage collector. Mapping an address to an entry in the table involves shifting the address right by k bits and using the result to index the table. The card table can be maintained explicitly by generating code to index and dirty the corresponding table entry at every store site in the program. Alternatively, by setting the card size to correspond to the virtual memory page size, updates to clean cards can be detected using the virtual memory hardware. All clean pages in the heap are protected from writes. When a write occurs to a protected page, the trap handler records the update in the card table and unprotects the page. Subsequent writes to the now dirty page incur no furtheroverhead. Notethat all writes to a clean page cause a protection trap, not just those that store pointers. The time required to determine the relevant older-toyounger pointers for garbage collection varies with the granularity of the information recorded. In an earlier study [5] Page 1
2 we showed that this is the dominant factor distinguishing different implementations of the write barrier, and that remembered sets offer the best performance because they compactly record just those locations that can possibly contain older-to-younger pointers. In contrast, the time to scan dirty cards is proportional to the size of the cards. While softwareimplemented card marking schemes are free to choose any power of two for the card size, a page trapping scheme is bound by the size of a virtual memory page. Since modern operating systems and architectures typically use a relatively large virtual memory page size (on the order of thousands of bytes), scanning overheads are very high. Nevertheless, card marking schemes have more predictable overhead at run time. The simple write barrier imposes a small, bounded amount of additional work on each store. Meanwhile, remembered set maintenance is typically more complicated, depending on the data structures used, and a given store may incur unpredictable cost. For example, the modified slot may already be recorded in the appropriate remembered set, otherwise it must be entered. On overflow, the set must be grown to accommodate the new entry. Such conditional code at every store site is also likely to be detrimental to performance on modern pipelined architectures. In this paper we consider a hybrid implementation which combines the precision of remembered sets with the simplicity of the card marking write barrier. As the dirty cards are scanned prior to each scavenge, the older-to-youngerpointers in those cards are summarized to the appropriate remembered sets, which are then used as the basis of the scavenge. The cards are thenceforth treated as clean. Subsequent scavenges need only update the remembered sets by rescanning just those cards that have been dirtied since the previous scavenge. We compare the performance of several implementations of this hybrid scheme (varying the card size, and using page traps to note updates) with the pure remembered set approach. 2 Implementation Our experiments are based on a high-performance Smalltalk interpreter of our own design, using the abstract definition of Goldberg and Robson [4]. The implementation consists of two components: the virtual machine and the virtual image. The virtual machine implements a bytecode instruction set to which Smalltalk source code is compiled, as well as other primitive functionality. While we have retained the standard bytecode instruction set of Goldberg and Robson [4], our implementation of the virtual machine differs somewhat from their original definition to allow for more efficient execution. Our virtual machine running on the DECstation 3100 performs around three times faster than a microcoded implementation on the Xerox Dorado. We compare several write barrier implementations: a pure remembered set approach, the hybrid card marking schemes (for various card sizes), and a similar page trapping scheme. We also measure the performance of an implementation that assumes an oracle to discover which pages of the heap are dirty at each garbage collection. This allows us to determine the optimal performance that could be expected if operating systems were to provide user-level dirty bits (as suggested by Shaw [8], and Appel and Li [3]). 2.1 Remembered sets To avoid making the remembered sets too large we record only those stores that create pointers from older objects to younger objects. This involves extra conditional overhead at every store site to perform the check, in addition to a subroutine call to update the remembered set if the condition is true. Smalltalk object references are tagged to allow direct encoding of non-pointer immediate values such as integers. Since many object references are immediate, the first action performed by the check is to filter out non-pointer stores. This is followed by a generation test to filter out initializing stores to objects in the youngest generation (such stores cannot create older-to-younger pointers). 1 Finally, if the store creates a pointer from an older object to a younger object the remembered set is updated with a subroutine call. In contrast to Ungar s remembered sets, ours record locations that might contain older-to-younger pointers, as opposed to objects. This saves unnecessary scanning upon garbage collection to determine the interesting pointers. On the MIPS R2000 non-pointers are filtered in 2 cycles. Filtering initializing stores requires another 8 cycles, while filtering the remaining uninteresting stores consumes a further 8 cycles. The entire inline sequence for a store typically comes to 22 instructions, including the store itself, filtering of uninterestingstores, and the call to update the remembered set. 2.2 Card marking For the card schemes we implement the card table as a contiguous byte array, one byte per card, so as to simplify the store check. 2 By interpreting zero bytes as dirty entries and non-zero bytes as clean, a pointer store can be recorded using just a shift, index, and byte store of zero. Since the most attractive feature of card marking is the simplicity of the write barrier, we omit the checks used in the pure remembered set scheme to filter uninteresting stores. Thus, on the MIPS R2000 a store can be recorded with just 5 instructions: 2 to load the base of the card table, a shift to determine the index, an add to index the table, and a byte store of zero. Including the store, the entire inline 1 Note that we do not mean that the stores occur at object allocation. Such stores never need to be recorded since objects are always allocated in the youngestgeneration. Moreover, Smalltalk objects are always initialized to contain only nil pointers. 2 We first heard of this idea from Paul Wilson. Page 2
3 sequence comes to 6 instructions. 3 If we kept the card table base in a register this sequence would shrink to 4 instructions (registers are at a premium in the interpreter). 2.3 Page traps The page trap scheme requires no inline code at store sites to detect pointer stores, relying instead on the page protection hardware to trap updates to protected pages. Thus there is no longer any advantage in using a byte table to simplify the store check. Rather, it is more important that the dirty page table consume the smallest possible space. For this reason we use a bit table; setting a bit indicates that the corresponding page is dirty. When a protection trap occurs the bit in the table corresponding to the modified page is set and the page unprotected User-level dirty bits If operating systems were to provide user-level dirty bits (as suggested by Shaw [8], and Appel and Li [3]), the overhead to reflect page traps throughto the user-level protection violation handler can be avoided. Presumably, an extra user-level dirty bit would be added to each page table entry, and a system call (dirty) provided to return a list of pages dirtied in a given address range since the last time it was called. The system call would clear the user-level dirty bits and enable traps on the specified pages. Traps could then be handled directly in the operating system. This can have substantial savings. As reported for a MIPS R2000 [1], the time for a user program to trap to a null C routine in the kernel and return to the user program is 15.4s round trip. In contrast, Appel and Li report the corresponding overhead to handle page-fault traps in user-mode to be 210s on a DECstation 3100 (MIPS R2000) running Ultrix 4.1. We have confirmed this with our own measurement of page traps in a tight loop using the same hardware and operating system configuration, obtaining a round-trip time of 250s. Note that these measurements are for a tight loop executing many repetitions, and so may tend to underestimate trap costs. Traps interspersed throughout a program s normal execution may perform less favorably, since the OS trap handling code and data structures needed to service the trap may no longer be in the hardware caches. Meanwhile, a call to dirty should be no more expensive than current primitives for manipulating page protections, except in copying out the dirty bit information, adding littleif any extra overhead to applications that use the new primitive. 3 We note that the byte store instruction on the R2000 is implemented in the memory hardware as a read-modify-write instruction, requiring several cycles for execution. 3 Experimental setup We ran our experiments on a DECstation 3100 (MIPS R2000A CPU clocked at 16.67MHz) running ULTRIX The benchmarks were run with the system in single user mode and the process s address space was locked in main memory to prevent paging. We measured elapsed time on the client machine using a custom timer board 5 having a resolution of 100 ns. The fine-grained accuracy of this timer allows separate measurement of each phase of a benchmark s execution. 4 Benchmarks We use two benchmarks to evaluate garbage collection performance. The first is a synthetic benchmark of our own devising based on tree creation. The second consists of several iterations through the standard macro benchmark suite that is used to compare the relative performance of Smalltalk implementations [7]. Our benchmarks have the following characteristics: Destroy trees with destructive updates: A large initial tree (2M bytes) is repeatedly mutated by randomly choosing a subtree to be replaced and fully recreated. The effect is to generate large amounts of garbage, since the subtree that is destroyed is no longer reachable, while retaining the rest of the tree to the next iteration. Rebuilding the subtree causes many pointer stores, some of which create older-to-younger pointers of interest to the garbage collector. Each run performs 160 garbage collections. Of the stores performed, are of non-immediate pointers. Of these, are non- initializing stores into objects in older generations, of which create interesting older-to-younger pointers. Interactive 10 iterations of the macro benchmarks: These measure a system s support for the programming activities that constitute typical interaction with the Smalltalk programming environment, such as keyboard activity,compilation of methods to bytecodes, and browsing. Each run performs 137 garbage collections. Of stores performed, are of non-immediate pointers. Of these, are non- initializing stores into objects in older generations, of which create interesting older-to-younger pointers. 4 DECstation and ULTRIX are registered trademarks of Digital Equipment Corporation. MIPS and R2000 are trademarks of MIPS Computer Systems. This version of the operating system had some official patches installed that fix bugs in the mprotect system call. 5 We thank Digital Equipment Corporation s Western Research Laboratory, and Jeff Mogul in particular, for giving us the high resolution timing board and the software necessary to support it. Page 3
4 5 Results We report the elapsed time of each phase of execution of the benchmark, including: running: the time spent in the interpreter executing the program, as opposed to the garbage collector (note that running includes the cost of store checks or page traps); roots: the time spent scanning through remembered sets or card/page tables and copying the immediate survivors; 6 promoted: the time spent copying any remaining survivors; and other: the time spent in any remaining GC bookkeeping activities. Figure 2 plots the results for the remembered set (remsets), hybrid page trap (pages), and hybrid card implementations (for card sizes of 16, 64, 256, 1024, and bytes) on the Destroy benchmark. The performance that might be obtained using a zero-cost implementation of dirty is estimated by taking the running, roots, andpromoted times for the oracle-based implementation along with the other overheads for the card marking scheme. This is plotted alongside the other measurements (dirty). For comparison, Figure 1 gives the results for the original non-hybrid card and page trap implementations. The results for the Interactive benchmark are similarly shown in Figures 3 and 4. In contrast with the original implementations, we see that summarizing interesting pointer information into remembered sets for use in subsequent scavenges can significantly reduce the scanning overhead needed to determine root objects for collection. This allows the hybrid card schemes to be competitive with the pure remembered set scheme, with the 1K byte card scheme being best overall. Nevertheless, the pure remembered set scheme still has markedly less overhead to determine the roots. We also note that using a bit table versus a byte table has little effect on root processing time (the roots times are very similar for dirty, which scans a bit table, and cards-4096, which scans a byte table). The results are somewhat less conclusive for running-time overheads. The variation in running time amongst the card schemes can only be explained by hardware data cache effects, since the card schemes all execute the exact same code (barring differences in the shift value used to index the card table). Similarly, the fact that the oracle-based dirty scheme does not exhibit the best running time of the different implementations can only be explained as a result of such data cache effects. Nevertheless, dirty has running time less than pages for both benchmarks. Since these implementations use exactly the same virtual machine and garbage collection data structures, any difference is unlikely to be due to 6 In Smalltalk the stack is stored as heap objects so there is no separate stack processing. In fact, all the process stacks are copied during each scavenge. Also, Smalltalk has only a few global variables, in the interpreter. hardware cache effects. Thus we can get some idea of the overhead to field a trap from the operating system, unprotect the appropriate page, and return to normal execution, by subtracting the running time of the oracle-based dirty scheme from that of the pages scheme, and dividing by the number of page traps. This yields a per-trap overhead of 4 387sfor the Destroy benchmark (864 traps), and 1 211s for the Interactive benchmark (1 656 traps), showing that the traps can be much more expensive than the lower bound of 250s we obtained by measuring their cost in a tight loop. These results suggest that the frequency of traps affects their cost. Presumably, more frequent traps mean that the hardware caches are more likely to contain the operating system code and data required to service a trap, making for faster trap handling. Given the number of store checks executed by the card schemes and the number of traps incurred by the page trap scheme for each benchmark, we can determine the tradeoff between using explicit code to maintain dirty bits and a page trapping approach. Ignoring hardware cache effects, the break-even point is determined by the formula: where cx = fty c = the number of store checks executed by an explicitly coded software scheme; x = cycles per check; f = clock frequency (16.67 MHz for DECstation 3100); t = the number of traps incurred by a page trapping scheme; y = s per trap. For these benchmarks this yields Table 1, which gives the maximum page trap overhead such that a page trapping approach will incur less running time than an alternative explicit implementation having the given overhead per store check. Let us assume that our current 5-instruction sequence for card marking executes in no more than 10 cycles. To be competitive a page trap implementation would have to incur no more than 41s and 237s per trap, for the Tree and Interactive benchmarks respectively. These values are significantly lower than the estimated trap overheads for these benchmarks quoted above, and lower even than the 250s lower bound obtained for a tight loop. Finally, we note that the hybrid page implementation incurs more page traps than the original implementation, since all pages are considered to be clean after each scavenge, rather than just those that contain no interesting pointers. This increases the running time component for the hybrid page trapping scheme. Nevertheless, the reduction in the number of dirty pages that must be scanned to determine the garbage collection roots makes this tradeoff well worthwhile, resulting in a net reduction in total execution time. Page 4
5 Running Roots Promoted Other pages cards-4096 cards-1024 cards-0256 cards-0064 cards-0016 remsets elapsed time (s) Figure 1: Destroy: old implementation Running Roots Promoted Other dirty pages cards-4096 cards-1024 cards-0256 cards-0064 cards-0016 remsets elapsed time (s) Figure 2: Destroy: new hybrid implementation Page 5
6 Running Roots Promoted Other pages cards-4096 cards-1024 cards-0256 cards-0064 cards-0016 remsets elapsed time (s) Figure 3: Interactive: old implementation Running Roots Promoted Other dirty pages cards-4096 cards-1024 cards-0256 cards-0064 cards-0016 remsets elapsed time (s) Figure 4: Interactive: new hybrid implementation Page 6
7 Tree Interactive Store checks (c) Page traps (t) Cycles per check (x) s per trap (y) Table 1: Break-even points for GC implementations that use page trapping vs explicit checks 5.1 Interpreters versus compilers The experiments and results we have presented are for an interpreted language. An obvious question is how they would change for a compiled language. The results will likely stand since compilation will tend to shrink the time actually spent in the program code, but garbage collection costs will be unaffected since they are part of the language run-time system. Thus, collection time overheads become more important, strengthening our arguments for software rather than hardware approaches in many circumstances. Reducing the incremental costs of noting updates for garbage collection will not improve the situation. Rather, it is better to invest in improving the garbage collection overheads, which are heavily impacted by the granularity of the noted updates. Nevertheless, inline checks do affect program size and possibly instruction cache behavior, so we cannot predict the situation with certainty. The size and frequency of inline checks will affect overhead with respect to a non-garbage collected implementation, but in the absence of contrary evidence, it is reasonable to assume that the relative ranking of the various schemes will remain the same. 6 Discussion Our earlier results [5] showed that, despite the more complicated store checks, remembered sets gave best performance overall because of their precise representation of older-toyounger pointers, allowing the scavenge roots to be discovered quickly. The hybrid scheme used here has eliminated the need to rescan cards that have not changed since the last scavenge, thus reducing the scanning overhead to locate roots. We have also established that a trap implementation is unlikely to be competitive with our software card marking scheme unless page trap overheads can be dramatically reduced. Thus, a combination of card marking with remembered sets seems the best option. One of the problems with any remembered set scheme is that in the worst case the remembered set for a given generation can grow to be as large as all the older generations if every word in the older generations contained a pointer into that generation then the remembered set would contain an entry for each of those words. At some point scanning a card becomes less expensive than the corresponding remembered set processing. By arranging for the hybrid garbage collector to detect when remembered sets are becoming overly large and unwieldy, it can dynamically switch over to card scanning on a card-by-card basis. If a given card contains more interesting pointers than can be efficiently recorded with remembered sets, then the card is marked as dirty. The interesting pointers are then rediscovered while scanning at the next scavenge. The collector can re-evaluate this decision at each scavenge, and switch back to recording the interesting pointers in the remembered sets. 7 Conclusions We have shown that a hybrid scheme which uses card marking to track pointer stores, and remembered sets to summarize the interesting pointers for garbage collection, can offer acceptable performance and attractive behavior. Remembered sets provide accurate determination of interesting pointers, but suffer from high store check costs. Cards offer a simple, predictable store check. Combining these two techniques provides a competitive scheme that has the store check overhead of cards while preserving most of the high precision of remsets, yielding better behaved, more predictable garbage collection. References [1] T. E. Anderson, H. M. Levy, B. N. Bershad, and E. D. Lazowska. The interaction of architecture and operating system design. In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, pages , Santa Clara, California, Apr ACM SIGPLAN Not. 26, 4 (Apr. 1991). [2] A. Appel. Simple generational garbage collection and fast allocation. Software: Practice and Experience, 19(2): , Feb [3] A. W. Appel and K. Li. Virtual memory primitives for user programs. In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, pages , Santa Clara, California, Apr ACM SIGPLAN Not. 26, 4 (Apr. 1991). [4] A. Goldberg and D. Robson. Smalltalk-80: The Language and its Implementation. Addison-Wesley, Page 7
8 [5] A. L. Hosking, J. E. B. Moss, and D. Stefanović. A comparative performance evaluation of write barrier implementations. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, pages , Vancouver, Canada, Oct ACM SIGPLAN Not. 27, 10 (Oct. 1992). [6] H. Lieberman and C. Hewitt. A real-time garbage collector based on the lifetimes of objects. Commun. ACM, 26(6): , June [7] K. McCall. The Smalltalk-80 benchmarks. In G. Krasner, editor, Smalltalk-80: Bits of History, Words of Advice, chapter 9, pages Addison-Wesley, [8] R. A. Shaw. Improving garbage collector performance in virtual memory. Technical Report CSL-TR , Stanford University, Mar [9] P. G. Sobalvarro. A lifetime-based garbage collector for LISP systems on general-purpose computers, B.S. Thesis, Dept. of EECS, Massachusetts Institute of Technology, Cambridge. [10] D. Ungar. Generation scavenging: A non-disruptive high performance storage reclamation algorithm. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, pages , Pittsburgh, Pennsylvania, Apr ACM SIGPLAN Not. 19, 5 (May 1984). [11] D. M. Ungar. The Design and Evaluation of a High Performance Smalltalk System. ACM Distinguished Dissertations. The MIT Press, Cambridge, MA, Ph.D. Dissertation, University of California at Berkeley, February [12] P. R. Wilson and T. G. Moher. Design of the Opportunistic Garbage Collector. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 23 35, New Orleans, Louisiana, Oct ACM SIGPLAN Not. 24, 10 (Oct. 1989). Page 8
Protection traps and alternatives for memory management of an object-oriented language.
Protection traps and alternatives for memory management of an object-oriented language. Antony L. Hosking J. Eliot B. Moss Object Systems Laboratory Department of Computer Science University of MassachusettsMore information
Garbage Collection in the Java HotSpot Virtual Machine
http://www.devx.com Printed from http://www.devx.com/java/article/21977/1954 Garbage Collection in the Java HotSpot Virtual Machine Gain a better understanding of how garbage collection in the Java HotSpotMore information
Persistent Binary Search Trees
Persistent Binary Search Trees Datastructures, UvA. May 30, 2008 0440949, Andreas van Cranenburgh Abstract A persistent binary tree allows access to all previous versions of the tree. This paper presentsMore information
Write Barrier Removal by Static Analysis
Write Barrier Removal by Static Analysis Karen Zee and Martin Rinard Laboratory for Computer Science Massachusetts Institute of Technology Cambridge, MA 02139 {kkz, firstname.lastname@example.com ABSTRACT We presentMore information
General Introduction
Managed Runtime Technology: General Introduction Xiao-Feng Li (firstname.lastname@example.com) 2012-10-10 Agenda Virtual machines Managed runtime systems EE and MM (JIT and GC) Summary 10/10/2012 Managed RuntimeMore information
Operating Systems. Virtual Memory
Operating Systems Virtual Memory Virtual Memory Topics. Memory Hierarchy. Why Virtual Memory. Virtual Memory Issues. Virtual Memory Solutions. Locality of Reference. Virtual Memory with Segmentation. PageMore information
Jonathan Worthington Scarborough Linux User Group
Jonathan Worthington Scarborough Linux User Group Introduction What does a Virtual Machine do? Hides away the details of the hardware platform and operating system. Defines a common set of instructions.More information
Interpreters and virtual machines. Interpreters. Interpreters. Why interpreters? Tree-based interpreters. Text-based interpreters
Interpreters and virtual machines Michel Schinz 2007 03 23 Interpreters Interpreters Why interpreters? An interpreter is a program that executes another program, represented as some kind of data-structure.More information
Binary search tree with SIMD bandwidth optimization using SSE
Binary search tree with SIMD bandwidth optimization using SSE Bowen Zhang, Xinwei Li 1.ABSTRACT In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendousMore information
Memory Allocation. Static Allocation. Dynamic Allocation. Memory Management. Dynamic Allocation. Dynamic Storage Allocation
Dynamic Storage Allocation CS 44 Operating Systems Fall 5 Presented By Vibha Prasad Memory Allocation Static Allocation (fixed in size) Sometimes we create data structures that are fixed and don t needMore information
Validating Java for Safety-Critical Applications
Validating Java for Safety-Critical Applications Jean-Marie Dautelle * Raytheon Company, Marlborough, MA, 01752 With the real-time extensions, Java can now be used for safety critical systems. It is thereforeMore information
CSCI E 98: Managed Environments for the Execution of Programs
CSCI E 98: Managed Environments for the Execution of Programs Draft Syllabus Instructor Phil McGachey, PhD Class Time: Mondays beginning Sept. 8, 5:30-7:30 pm Location: 1 Story Street, Room 304. OfficeMore information
Hardware and Software Support for Efficient Exception Handling
Hardware and Software Support for Efficient Exception Handling Chandramohan A. Thekkath and Henry M. Levy Department of Computer Science and Engineering University of Washington Seattle, WA 98195 TechnicalMore information
Compiler Design Prof. Y. N. Srikant Department of Computer Science and Automation Indian Institute of Science, Bangalore
Compiler Design Prof. Y. N. Srikant Department of Computer Science and Automation Indian Institute of Science, Bangalore Module No. # 02 Lecture No. # 05 Run-time Environments-Part 3 and Local OptimizationsMore information
A Comparison of General Approaches to Multiprocessor Scheduling
A Comparison of General Approaches to Multiprocessor Scheduling Jing-Chiou Liou AT&T Laboratories Middletown, NJ 0778, USA email@example.com Michael A. Palis Department of Computer Science Rutgers UniversityMore information
Storage Management for Files of Dynamic Records
Storage Management for Files of Dynamic Records Justin Zobel Department of Computer Science, RMIT, GPO Box 2476V, Melbourne 3001, Australia. email@example.com Alistair Moffat Department of Computer ScienceMore information
Hardware/Software Co-Design of a Java Virtual Machine
Hardware/Software Co-Design of a Java Virtual Machine Kenneth B. Kent University of Victoria Dept. of Computer Science Victoria, British Columbia, Canada firstname.lastname@example.com Micaela Serra University of VictoriaMore information
Chapter 1. Dr. Chris Irwin Davis Email: email@example.com Phone: (972) 883-3574 Office: ECSS 4.705. CS-4337 Organization of Programming Languages
Chapter 1 CS-4337 Organization of Programming Languages Dr. Chris Irwin Davis Email: email@example.com Phone: (972) 883-3574 Office: ECSS 4.705 Chapter 1 Topics Reasons for Studying Concepts of ProgrammingMore information
The Design of the Inferno Virtual Machine. Introduction
The Design of the Inferno Virtual Machine Phil Winterbottom Rob Pike Bell Labs, Lucent Technologies {philw, firstname.lastname@example.com http://www.lucent.com/inferno Introduction Virtual Machine are topicalMore information
Language Evaluation Criteria. Evaluation Criteria: Readability. Evaluation Criteria: Writability. ICOM 4036 Programming Languages
ICOM 4036 Programming Languages Preliminaries Dr. Amirhossein Chinaei Dept. of Electrical & Computer Engineering UPRM Spring 2010 Language Evaluation Criteria Readability: the ease with which programsMore information
1 The Java Virtual Machine
1 The Java Virtual Machine About the Spec Format This document describes the Java virtual machine and the instruction set. In this introduction, each component of the machine is briefly described. ThisMore information
Instruction Set Architecture (ISA)
Instruction Set Architecture (ISA) * Instruction set architecture of a machine fills the semantic gap between the user and the machine. * ISA serves as the starting point for the design of a new machineMore information
Garbage Collection in NonStop Server for Java
Garbage Collection in NonStop Server for Java Technical white paper Table of contents 1. Introduction... 2 2. Garbage Collection Concepts... 2 3. Garbage Collection in NSJ... 3 4. NSJ Garbage CollectionMore information
Symbol Tables. Introduction
Symbol Tables Introduction A compiler needs to collect and use information about the names appearing in the source program. This information is entered into a data structure called a symbol table. TheMore information
Replication on Virtual Machines
Replication on Virtual Machines Siggi Cherem CS 717 November 23rd, 2004 Outline 1 Introduction The Java Virtual Machine 2 Napper, Alvisi, Vin - DSN 2003 Introduction JVM as state machine Addressing non-determinismMore information
Storage Allocation in Typed Languages
Storage Allocation in Typed Languages Butler W. Lampson Xerox Corporation Palo Alto Research Center Appeared in Proc. 5th Ann. III Conf: Implementation and Design of Algorithmic Languages, Guidel, France,More information
İSTANBUL AYDIN UNIVERSITY FACULTY OF ENGİNEERİNG SOFTWARE ENGINEERING THE PROJECT OF THE INSTRUCTION SET COMPUTER ORGANIZATION GÖZDE ARAS B1205.090015 Instructor: Prof. Dr. HASAN HÜSEYİN BALIK DECEMBERMore information
PART IV Performance oriented design, Performance testing, Performance tuning & Performance solutions. Outline. Performance oriented design
PART IV Performance oriented design, Performance testing, Performance tuning & Performance solutions Slide 1 Outline Principles for performance oriented design Performance testing Performance tuning GeneralMore information
find model parameters, to validate models, and to develop inputs for models. c 1994 Raj Jain 7.1
Monitors Monitor: A tool used to observe the activities on a system. Usage: A system programmer may use a monitor to improve software performance. Find frequently used segments of the software. A systemsMore information
Mission-Critical Java. An Oracle White Paper Updated October 2008
Mission-Critical Java An Oracle White Paper Updated October 2008 Mission-Critical Java The Oracle JRockit family of products is a comprehensive portfolio of Java runtime solutions that leverages the baseMore information
Java Virtual Machine: the key for accurated memory prefetching
Java Virtual Machine: the key for accurated memory prefetching Yolanda Becerra Jordi Garcia Toni Cortes Nacho Navarro Computer Architecture Department Universitat Politècnica de Catalunya Barcelona, SpainMore information
The Classical Architecture. Storage 1 / 36
1 / 36 The Problem Application Data? Filesystem Logical Drive Physical Drive 2 / 36 Requirements There are different classes of requirements: Data Independence application is shielded from physical storageMore information
Advanced compiler construction. General course information. Teacher & assistant. Course goals. Evaluation. Grading scheme. Michel Schinz 2007 03 16
Advanced compiler construction Michel Schinz 2007 03 16 General course information Teacher & assistant Course goals Teacher: Michel Schinz email@example.com Assistant: Iulian Dragos INR 321, 368 64More information
A Practical Method to Diagnose Memory Leaks in Java Application Alan Yu
A Practical Method to Diagnose Memory Leaks in Java Application Alan Yu 1. Introduction The Java virtual machine s heap stores all objects created by a running Java application. Objects are created byMore information
Real-Time Replication Garbage Collection
Real-Time Replication Garbage Collection Scott Nettles and James O Toole Abstract We have implemented the first copying garbage collector that permits continuousunimpeded mutator access to the originalMore information
Performance Measurement of Dynamically Compiled Java Executions
Performance Measurement of Dynamically Compiled Java Executions Tia Newhall and Barton P. Miller University of Wisconsin Madison Madison, WI 53706-1685 USA +1 (608) 262-1204 {newhall,firstname.lastname@example.com information
Overlapping Data Transfer With Application Execution on Clusters
Overlapping Data Transfer With Application Execution on Clusters Karen L. Reid and Michael Stumm email@example.com email@example.com Department of Computer Science Department of Electrical and ComputerMore information
Helping you avoid stack overflow crashes!
Helping you avoid stack overflow crashes! One of the toughest (and unfortunately common) problems in embedded systems is stack overflows and the collateral corruption that it can cause. As a result, weMore information
Characteristics of Java (Optional) Y. Daniel Liang Supplement for Introduction to Java Programming
Characteristics of Java (Optional) Y. Daniel Liang Supplement for Introduction to Java Programming Java has become enormously popular. Java s rapid rise and wide acceptance can be traced to its designMore information
System Virtual Machines
System Virtual Machines Introduction Key concepts Resource virtualization processors memory I/O devices Performance issues Applications 1 Introduction System virtual machine capable of supporting multipleMore information
INTRODUCTION 1 Programming languages have common concepts that are seen in all languages This course will discuss and illustrate these common concepts: Syntax Names Types Semantics Memory Management WeMore information
Building Scalable Applications Using Microsoft Technologies
Building Scalable Applications Using Microsoft Technologies Padma Krishnan Senior Manager Introduction CIOs lay great emphasis on application scalability and performance and rightly so. As business grows,More information
Whitepaper: performance of SqlBulkCopy
We SOLVE COMPLEX PROBLEMS of DATA MODELING and DEVELOP TOOLS and solutions to let business perform best through data analysis Whitepaper: performance of SqlBulkCopy This whitepaper provides an analysisMore information
Reconfigurable Architecture Requirements for Co-Designed Virtual Machines
Reconfigurable Architecture Requirements for Co-Designed Virtual Machines Kenneth B. Kent University of New Brunswick Faculty of Computer Science Fredericton, New Brunswick, Canada email@example.com Micaela SerraMore information
Real-time Java Processor for Monitoring and Test
Real-time Java Processor for Monitoring and Test Martin Zabel, Thomas B. Preußer, Rainer G. Spallek Technische Universität Dresden {zabel,preusser,email@example.com Abstract This paper introducesMore information
SYSTEM ecos Embedded Configurable Operating System
BELONGS TO THE CYGNUS SOLUTIONS founded about 1989 initiative connected with an idea of free software ( commercial support for the free software ). Recently merged with RedHat. CYGNUS was also the originalMore information
Scheduler Activations: Effective Kernel Support for the User-Level Management of Parallelism
[Recreated electronic version by Eric A. Brewer (firstname.lastname@example.com), Oct 20, 1998] Scheduler Activations: Effective Kernel Support for the User-Level Management of Parallelism THOMAS E. ANDERSON,More information
Physical Data Organization
Physical Data Organization Database design using logical model of the database - appropriate level for users to focus on - user independence from implementation details Performance - other major factorMore information
Synchronization. Todd C. Mowry CS 740 November 24, 1998. Topics. Locks Barriers
Synchronization Todd C. Mowry CS 740 November 24, 1998 Topics Locks Barriers Types of Synchronization Mutual Exclusion Locks Event Synchronization Global or group-based (barriers) Point-to-point tightlyMore information
Lecture 10: Dynamic Memory Allocation 1: Into the jaws of malloc()
CS61: Systems Programming and Machine Organization Harvard University, Fall 2009 Lecture 10: Dynamic Memory Allocation 1: Into the jaws of malloc() Prof. Matt Welsh October 6, 2009 Topics for today DynamicMore information
Constant-Time Root Scanning for Deterministic Garbage Collection
Constant-Time Root Scanning for Deterministic Garbage Collection Fridtjof Siebert Institut für Programmstrukturen and Datenorganisation (IPD) Universität Karlsruhe Am Fasanengarten 5 76128 Karlsruhe, GermanyMore information
PC Based Escape Analysis in the Java Virtual Machine
PC Based Escape Analysis in the Java Virtual Machine Manfred Jendrosch, Gerhard W. Dueck, Charlie Gracie, and AndréHinkenjann Abstract Current computer architectures are multi-threaded and make use ofMore information
Chapter 7D The Java Virtual Machine
This sub chapter discusses another architecture, that of the JVM (Java Virtual Machine). In general, a VM (Virtual Machine) is a hypothetical machine (implemented in either hardware or software) that directlyMore information
Resource Allocation Schemes for Gang Scheduling
Resource Allocation Schemes for Gang Scheduling B. B. Zhou School of Computing and Mathematics Deakin University Geelong, VIC 327, Australia D. Walsh R. P. Brent Department of Computer Science AustralianMore information
Tail Recursion Without Space Leaks
Tail Recursion Without Space Leaks Richard Jones Computing Laboratory University of Kent at Canterbury Canterbury, Kent, CT2 7NF rejukc.ac.uk Abstract The G-machine (Johnsson, 1987; Peyton Jones, 1987)More information
Volume 2, No. 3, March 2011 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info IMPROVING PERFORMANCE OF RANDOMIZED SIGNATURE SORT USING HASHING AND BITWISEMore information
Memory management in C: The heap and the stack
Memory management in C: The heap and the stack Leo Ferres Department of Computer Science Universidad de Concepción firstname.lastname@example.com October 7, 2010 1 Introduction When a program is loaded into memory, itMore information
File Management. Chapter 12
Chapter 12 File Management File is the basic element of most of the applications, since the input to an application, as well as its output, is usually a file. They also typically outlive the executionMore information
Instruction Set Design
Instruction Set Design Instruction Set Architecture: to what purpose? ISA provides the level of abstraction between the software and the hardware One of the most important abstraction in CS It s narrow,More information
How to Correctly Simulate Memory Allocation Behavior of Applications by Calibrating Main Memory Stubs
How to Correctly Simulate Memory Allocation Behavior of Applications by Calibrating Main Memory Stubs Peter Trapp, Markus Meyer, and Christian Facchi University of Applied Sciences Ingolstadt Ingolstadt,More information
Last Class: OS and Computer Architecture. Last Class: OS and Computer Architecture
Last Class: OS and Computer Architecture System bus Network card CPU, memory, I/O devices, network card, system bus Lecture 3, page 1 Last Class: OS and Computer Architecture OS Service Protection InterruptsMore information
Introduction. What is an Operating System?
Introduction What is an Operating System? 1 What is an Operating System? 2 Why is an Operating System Needed? 3 How Did They Develop? Historical Approach Affect of Architecture 4 Efficient UtilizationMore information
Departamento de Investigación. LaST: Language Study Tool. Nº 143 Edgard Lindner y Enrique Molinari Coordinación: Graciela Matich
Departamento de Investigación LaST: Language Study Tool Nº 143 Edgard Lindner y Enrique Molinari Coordinación: Graciela Matich Noviembre 2005 Para citar este documento: Lindner, Edgard; Enrique Molinari,More information
White Paper. Real-time Capabilities for Linux SGI REACT Real-Time for Linux
White Paper Real-time Capabilities for Linux SGI REACT Real-Time for Linux Abstract This white paper describes the real-time capabilities provided by SGI REACT Real-Time for Linux. software. REACT enablesMore information
Data Abstraction and Hierarchy
Data Abstraction and Hierarchy * This research was supported by the NEC Professorship of Software Science and Engineering. Barbara Liskov Affiliation: MIT Laboratory for Computer Science Cambridge, MA,More information
An Implementation Of Multiprocessor Linux
An Implementation Of Multiprocessor Linux This document describes the implementation of a simple SMP Linux kernel extension and how to use this to develop SMP Linux kernels for architectures other thanMore information
PERFORMANCE ENHANCEMENTS IN TreeAge Pro 2014 R1.0
PERFORMANCE ENHANCEMENTS IN TreeAge Pro 2014 R1.0 15 th January 2014 Al Chrosny Director, Software Engineering TreeAge Software, Inc. firstname.lastname@example.com Andrew Munzer Director, Training and CustomerMore information
2. Compressing data to reduce the amount of transmitted data (e.g., to save money).
Presentation Layer The presentation layer is concerned with preserving the meaning of information sent across a network. The presentation layer may represent (encode) the data in various ways (e.g., dataMore information
Advanced Computer Architecture-CS501. Computer Systems Design and Architecture 2.1, 2.2, 3.2
Lecture Handout Computer Architecture Lecture No. 2 Reading Material Vincent P. Heuring&Harry F. Jordan Chapter 2,Chapter3 Computer Systems Design and Architecture 2.1, 2.2, 3.2 Summary 1) A taxonomy ofMore information
The V8 JavaScript Engine
The V8 JavaScript Engine Design, Implementation, Testing and Benchmarking Mads Ager, Software Engineer Agenda Part 1: What is JavaScript? Part 2: V8 internals Part 3: V8 testing and benchmarking What isMore information
Understanding the Economics of Flash Storage
Understanding the Economics of Flash Storage By James Green, vexpert Virtualization Consultant and Scott D. Lowe, vexpert Co-Founder, ActualTech Media February, 2015 Table of Contents Table of Contents...More information
ABSTRACT EFFICIENT EXTERNAL SORTING ON FLASH MEMORY EMBEDDED DEVICES Tyler Cossentine and Ramon Lawrence Department of Computer Science, University of British Columbia Okanagan Kelowna, BC, Canada email@example.com information
Java's garbage-collected heap
Sponsored by: This story appeared on JavaWorld at http://www.javaworld.com/javaworld/jw-08-1996/jw-08-gc.html Java's garbage-collected heap An introduction to the garbage-collected heap of the JavaMore information
Benchmarking Hadoop & HBase on Violin
Technical White Paper Report Technical Report Benchmarking Hadoop & HBase on Violin Harnessing Big Data Analytics at the Speed of Memory Version 1.0 Abstract The purpose of benchmarking is to show advantagesMore information
Exceptions in MIPS. know the exception mechanism in MIPS be able to write a simple exception handler for a MIPS machine
7 Objectives After completing this lab you will: know the exception mechanism in MIPS be able to write a simple exception handler for a MIPS machine Introduction Branches and jumps provide ways to changeMore information
SIMULATION OF LOAD BALANCING ALGORITHMS: A Comparative Study
SIMULATION OF LOAD BALANCING ALGORITHMS: A Comparative Study Milan E. Soklic Abstract This article introduces a new load balancing algorithm, called diffusive load balancing, and compares its performanceMore information
The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge,
The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge, cheapest first, we had to determine whether its two endpointsMore information
Oracle Solaris Studio Code Analyzer
Oracle Solaris Studio Code Analyzer The Oracle Solaris Studio Code Analyzer ensures application reliability and security by detecting application vulnerabilities, including memory leaks and memory accessMore information
Monitoring, Tracing, Debugging (Under Construction)
Monitoring, Tracing, Debugging (Under Construction) I was already tempted to drop this topic from my lecture on operating systems when I found Stephan Siemen's article "Top Speed" in Linux World 10/2003.More information
Memory Management in Java
CMSC 433 Programming Language Technologies and Paradigms Spring 2006 Memory Management Memory Management in Java Local variables live on the Allocated at method invocation time Deallocated when methodMore information
Instruction Set Architecture (ISA) Design. Classification Categories
Instruction Set Architecture (ISA) Design Overview» Classify Instruction set architectures» Look at how applications use ISAs» Examine a modern RISC ISA (DLX)» Measurement of ISA usage in real computersMore information
A Content-Based Load Balancing Algorithm for Metadata Servers in Cluster File Systems*
A Content-Based Load Balancing Algorithm for Metadata Servers in Cluster File Systems* Junho Jang, Saeyoung Han, Sungyong Park, and Jihoon Yang Department of Computer Science and Interdisciplinary ProgramMore information
Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm
Journal of Al-Nahrain University Vol.15 (2), June, 2012, pp.161-168 Science Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm Manal F. Younis Computer Department, CollegeMore information
Hadoop Fair Scheduler Design Document
Hadoop Fair Scheduler Design Document October 18, 2010 Contents 1 Introduction 2 2 Fair Scheduler Goals 2 3 Scheduler Features 2 3.1 Pools........................................ 2 3.2 Minimum Shares.................................More information
Measuring MPI Send and Receive Overhead and Application Availability in High Performance Network Interfaces
Measuring MPI Send and Receive Overhead and Application Availability in High Performance Network Interfaces Douglas Doerfler and Ron Brightwell Center for Computation, Computers, Information and Math SandiaMore information
Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY. 6.828 Operating System Engineering: Fall 2005
Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.828 Operating System Engineering: Fall 2005 Quiz II Solutions Average 84, median 83, standard deviationMore information
Java Performance Tuning
Summer 08 Java Performance Tuning Michael Finocchiaro This white paper presents the basics of Java Performance Tuning for large Application Servers. h t t p : / / m f i n o c c h i a r o. w o r d p r eMore information
JVM Performance Study Comparing Oracle HotSpot and Azul Zing Using Apache Cassandra
JVM Performance Study Comparing Oracle HotSpot and Azul Zing Using Apache Cassandra January 2014 Legal Notices Apache Cassandra, Spark and Solr and their respective logos are trademarks or registered trademarksMore information
Operating Systems. Week 2 Recitation: The system call. Paul Krzyzanowski. Rutgers University. Spring 2015
Operating Systems Week 2 Recitation: The system call Paul Krzyzanowski Rutgers University Spring 2015 February 14, 2015 2014-2015 Paul Krzyzanowski 1 System calls System calls are an operating system sMore information
1. Overview of the Java Language
1. Overview of the Java Language What Is the Java Technology? Java technology is: A programming language A development environment An application environment A deployment environment It is similar in syntaxMore information
Data on Kernel Failures and Security Incidents
Data on Kernel Failures and Security Incidents Ravishankar K. Iyer (W. Gu, Z. Kalbarczyk, G. Lyle, A. Sharma, L. Wang ) Center for Reliable and High-Performance Computing Coordinated Science LaboratoryMore information
FLIX: Fast Relief for Performance-Hungry Embedded Applications
FLIX: Fast Relief for Performance-Hungry Embedded Applications Tensilica Inc. February 25 25 Tensilica, Inc. 25 Tensilica, Inc. ii Contents FLIX: Fast Relief for Performance-Hungry Embedded Applications...More information
10.04.2008. Thomas Fahrig Senior Developer Hypervisor Team. Hypervisor Architecture Terminology Goals Basics Details
Thomas Fahrig Senior Developer Hypervisor Team Hypervisor Architecture Terminology Goals Basics Details Scheduling Interval External Interrupt Handling Reserves, Weights and Caps Context Switch WaitingMore information
Performance evaluation of Web Information Retrieval Systems and its application to e-business
Performance evaluation of Web Information Retrieval Systems and its application to e-business Fidel Cacheda, Angel Viña Departament of Information and Comunications Technologies Facultad de Informática,More information
Chapter 11 I/O Management and Disk Scheduling
Operating Systems: Internals and Design Principles, 6/E William Stallings Chapter 11 I/O Management and Disk Scheduling Dave Bremer Otago Polytechnic, NZ 2008, Prentice Hall I/O Devices Roadmap OrganizationMore information
Storage in Database Systems. CMPSCI 445 Fall 2010
Storage in Database Systems CMPSCI 445 Fall 2010 1 Storage Topics Architecture and Overview Disks Buffer management Files of records 2 DBMS Architecture Query Parser Query Rewriter Query Optimizer QueryMore information
picojava TM : A Hardware Implementation of the Java Virtual Machine
picojava TM : A Hardware Implementation of the Java Virtual Machine Marc Tremblay and Michael O Connor Sun Microelectronics Slide 1 The Java picojava Synergy Java s origins lie in improving the consumerMore information
Lecture 4 Representing Data on the Computer. Ramani Duraiswami AMSC/CMSC 662 Fall 2009
Lecture 4 Representing Data on the Computer Ramani Duraiswami AMSC/CMSC 662 Fall 2009 x = ±(1+f) 2 e 0 f < 1 f = (integer < 2 52 )/ 2 52-1022 e 1023 e = integer Effects of floating point Effects of floatingMore information
Chapter 3 Operating-System Structures
Contents 1. Introduction 2. Computer-System Structures 3. Operating-System Structures 4. Processes 5. Threads 6. CPU Scheduling 7. Process Synchronization 8. Deadlocks 9. Memory Management 10. VirtualMore information
WHITE PAPER Optimizing Virtual Platform Disk Performance
WHITE PAPER Optimizing Virtual Platform Disk Performance Think Faster. Visit us at Condusiv.com Optimizing Virtual Platform Disk Performance 1 The intensified demand for IT network efficiency and lowerMore information


text: american history Just Plain Dick by Kevin Mattson By Joe Donahue • Sep 20, 2012 It all started with some businessmen bankrolling Richard Nixon to become a "salesman against socialization." But in this precursor to current campaign finance scandals, Nixon had some explaining to do to keep his place on Eisenhower's Republican ticket, so he took to the airwaves. In making his speech, Nixon left behind lines about a "Republican cloth coat" and a black and white cocker spaniel named "Checkers." The speech saved and bolstered Nixon's political career and set the tone for the 1952 campaign. Thomas Jefferson's Creme Brulee By Joe Donahue • Sep 19, 2012 In 1784, Thomas Jefferson struck a deal with one of his slaves, 19-year-old James Hemings. The founding Father was traveling to Paris and wanted to bring James along "for a particular purpose" – to master the art of French cooking. In exchange for James's cooperation, Jefferson would grant his freedom. Thus began one of the strangest partnerships in U.S. history. As James apprenticed under master French chefs, Jefferson studied the cultivation of French crops (especially grapes for winemaking) so they might be replicated in American agriculture. The Book Show #1253 - Stephen L. Carter By Joe Donahue • Jul 24, 2012 Imagine that Abraham Lincoln survived that infamous night in Ford's Theatre, only to eventually meet the same fate that awaited Andrew Johnson: impeachment for alleged high crimes and misdemeanors. "Me the People" by Kevin Bleyer By Joe Donahue • Jul 3, 2012 We welcome Kevin Bleyer, writer for The Daily Show, and speak with him about his new book, Me the People: One Man's Selfless Quest to Rewrite the Constitution of the United States of America. Barrington Stage Company - Herman Melville's Arrowhead By Joe Donahue & Alan Chartock • Jun 29, 2012 Will Garrison - Curator of the Berkshire Historical Society at Herman Melville's Arrowhead; Michael Melle, the artist who created "Ahab and the Whale" – a sculpture currently on installed in the field at Arrowhead; and Jana Laiz, Arrowhead's Writer-in-Residence join us to talk about this summer's "Call Me Melville" celebration. "The Blood of Heroes" By Joe Donahue • Jun 27, 2012 We speak with NYT bestselling author, James Donovan, about his new book, The Blood of Heroes: The 13-Day Struggle for the Alamo--and the Sacrifice That Forged a Nation. Pages« first ‹ previous … 11 12 13 14 15 16 17 18 19


text:
Free Download MOD APK Down The Mountain | Only best games at Sbenny.com
Game Description:
Down The Mountain is a unique and fast-paced arcade game that will keep you hooked for hours. The goal of the game is to descend from an infinite mountain, while avoiding many obstacles and enemies, and grabbing stars and power-ups.
Features of Down The Mountain:
- Beautiful graphics
- Simple yet challenging gameplay
- 99 unlockable characters
- 300 missions to complete
- Win prizes with the prizewheel
Game Requirements and Details:
Android Version Required: 3.0 and higher versions of Android Smartphones and Tablets
Required Storage Space: 26 MB or more
Internet connection NOT required to play
Last Game Version: 1.2.6
APK ID: com.umbrella.downthemountain
Genre: Arcade
Price: Free with In-App Purchases
Ads? NO
Installation Instructions:
- Download one of the [APK] files below (the MOD version is the HACKED game) OR try the [Google Play] version;
- Move the .apk game file into your Android Smartphone or Tablet and install it (if you are on mobile, just install the apk tapping on it);
- Launch the game and have fun with Down The Mountain
Free Download Down The Mountain APK Android
Broken Link? Outdated Version? Report it! Want us to make a custom MOD for you? Visit our dedicated Forum!
[APK] [26.5 MB] [v1.2.6] [MOD - Unlimited Money]
[APK+DATA] [Google Play] [Free Game]
Have troubles installing Down The Mountain? Please read our Forum guide on HOW TO INSTALL ANDROID GAMES AND APPS.
Link broken? Looking for a newer or HACKED version of Down The Mountain? Join our community and we will help you!


text:
"My father was an important influence on my decision to become a physician. I remember as early as age 10 accompanying him to the hospital as he did his weekend rounds. When I saw the positive influence his care had on patients, I knew I wanted to be able to help people too. I look forward to working with my patients to understand their needs and personalize their care to achieve and maintain their best possible health."
Dr. Gupta grew up in the Palm Springs area and attended the University of California at Los Angeles, for his Bachelors of Science degree. He went on to earn a Masters of Science from Hunter College in New York prior to entering medical school back in California. He was chosen as Chief Resident for 2010-2011 while completing his residency in Philadelphia. Dr. Gupta is board certified in Rheumatology.
When not in the office, Dr. Gupta enjoys spending time with his wife and two young children and playing tennis and golf.
As a specialist, Dr. Gupta may not be selected as a primary care physician. He accepts patients age 18 and older.
This physician is a member of MemorialCare Physician Society which drives clinical outcomes and performance for MemorialCare Health System.
This physician or health care professional uses an electronic medical record system.
This physician or health care professional uses myMemorialCare to access and store patient health information via the Epic ambulatory electronic medical record system. Patients of this practice may also securely view their health information online via myMemorialCare (MyChart), Epic's patient portal.
- Rheumatology


text:
Welcome to the CDSS Store
Quick Links:
• Log In • Log Out • Reset Password • Order and Shipping Schedule • Register an Account • Store Home
• Become a Member • Make a Gift • Register for Camp • Pay Camp Balance • Buy Insurance • Go to the Member Directory
Having trouble? DON'T PANIC!
Just email us at email@example.com or call 413-203-5467. You can also click here to read Frequently Asked Questions.
Affiliate Program
CDSS Store affiliate program is free and enables members to earn revenue by placing a link or links on their web site which advertises CDSS Store or specific products on it. Any sales made to customers who have clicked on those links will earn the affiliate commission. The standard commission rate is currently 5%.
For more information, visit our FAQ page or see our Affiliate terms & conditions.
New Affiliate
I am not currently an affiliate.
Click Continue below to create a new affiliate account. Please note that this is not connected in any way to your customer account.Continue
Looking for a recording of a particular English dance tune? Check out this list of tunes and recordings many of which we offer CDSS store. If you are not finding what you are looking for, we are just a phone call or email away. 413.203.5467x103 firstname.lastname@example.com.
CDSS Ringtones - Download ECD and Contra ringtones for your smartphone!
- Audio - CDs and Cassettes
- Bells and Swords
- Books
- Camp 2017
- Cards and Calendars
- Children and Community Dance
- Contra Dance
- Display/Ritual Dance
- Donation - Annual Appeal
- Donation - Lead/Scholarship
- Donation - Spread the Joy
- English Dance
- Folk Song
- Instruction Included
- Insurance
- Insurance - Additional Insureds
- Insurance - Callers Flat Rate
- Insurance - Group Flat Rate
- Insurance - Group Per Event
- Jewelry
- Listening/Instrumental
- Membership
- T-shirts, Totes and Towels
- Video - DVDs and VHS
- General Products


text:
Botox side effects informationBotox is a safe and effective treatment when used in accordance with approved procedures. Any botox side effects are generally minor, if they occur at all. When side effects do occur, they're usually the result of over-treatment.
|7D-NLS Computer Health Analyzer Medicomat-36
37486 7D-NLS Health Body Composition Analyzer - 10 Minute Examination - Accuracy over 90% - Not Side Effects - Health Trends - Recovery Plan - Warranty one year - 7D-NLS Software; Language available: English, Spanish, German, Russian. Main function: 1. Health analysis equipment is not invasive detection, the test will not have any discomfort. Non-voltage electrical stimulation, do not touch the skin, not play reagent. No any hazardous radiation damage, not to take off a sweater, not need wait-not fasting, not any side effects. 2. Test different food/health care products affect the circumstances of the body. 3. Repair treatment function: With energy spectrum restoration and repait function, to the early stages of the disease or has not been formed stage,especially for pain spot repair has the very good auxiliary effect.


text:
As a junior, Williams already has an array of impressive statistics: 83 tackles (23 of them for a loss), 12 quarterback hurries, 4 forced fumbles, 2 sacks, 4 passes broken up, 4 fumbles recovered, and a partridge in a pear tree (thanks to DarthOneGator for that one!).
Those kind of numbers earned Williams a special trip to Gainesville to see what the University of Florida had to offer on their first Junior Day of the 2007 recruiting season.
"I was there Saturday and showed up around 6:30," said Williams. "I got to meet some of the other kids from Lakeland and Tampa. I got to see Coach Mattison, my defensive line coach, and see Coach Strong. It's a good bunch of guys and a great family atmosphere."
Not surprisingly, the Gator that stood out to most, especially to Williams, was Tim Tebow. "The only player I met was Tim Tebow," Williams said. "He was a pretty big guy for a quarterback. That surprised me when he spoke. I think in the next few years he will be a real good leader when Chris Leak leaves."
After Tebow spoke, the staff was introduced to the prospects in attendance. Next was a quick trip to the Swamp and then to see the Gators take on Kentucky in hoops with a frenzied O'Connell Center crowd on hand. Williams was more than impressed.
"We had a little get together and they introduced the coaches to us," Williams said. "We had a couple of snacks and then watched a highlight film on the big screen in the Swamp. Then we went over to the basketball game. It was a great game to be at and a big influence on me. I really like Florida as of right now, I really do."
The Gators haven't always been at the forefront of William's thoughts until recently. As a matter of fact, he's always been a Florida State fan.
"My favorite team was Florida State," he said. "Craphonso Thorpe was my cousin and he played for Florida State. You know how sometimes you fall in love with the first team you see, that's why I liked them when I was younger."
Fortunately for the Gators, all of that changed after last week.
"When Urban Meyer came to see me, he came to the school a week ago Friday and wanted to watch some film on me," he said. "They liked what they saw. They showed they really wanted me. Coach Strong sent me a text (message) on Tuesday and when I called they told me they wanted to offer me a scholarship. When he said that, I couldn't stop smiling. They are my top team right now."
The talented defensive tackle does everything on the field as a football player, but he's only been playing the sport in an organized fashion for a little over three years. Family finances made it tough for Williams to get on the field as an only child in a one parent home living with his mother.
"I started my freshman year, that was the first year of organized football," Williams said. "I played basketball and football as a freshman. Then football and weightlifting as a sophomore.
He will probably play offensive guard also for Lyman this year, but will certainly be a defensive tackle at the next level. He thinks he understand what his coaches see in him.
"Coaches would say that I play with leverage and speed," he said. "I learned the leverage from my defensive line coach and just from watching football. When I was younger I would just watch film of college and pro teams and try it myself."
Williams is already in the middle of weight lifting season and will participate on the Lyman track team in the shot put and discuss. In the meantime, he will start preparing for the deluge of recruiting calls and messages, some of which has already started. He already has five schools on his list.
"Florida is the only offer right now," he said. "I get a lot of letters and mail from Auburn and UCF and a couple of other schools. I would say my top schools would be Florida, Florida State, Auburn, UCF, and Miami."
"I have to work on my academics, that is the most important thing," said Williams. "I have a 3.0 average in my core courses right now, and I will take the first ACT two weeks from now and the SAT soon after that. I want to work on trying to be a better player. I need to listen to my coaches and get better at the little things my coaches can teach me to be the best I can be."
Williams participated in the US Army All-American combine in San Antonio in January and then made the trip to Gainesville. He has already started making friends on the recruiting trail.
"I met a couple of kids that were also at the combine in Texas," said Williams. "The Pouncey twins were there, Chris Rainey, Stephen Garcia. There was a good one from Pensacola and a couple of good ones from Miami. Unfortunately, John Brown wasn't there."
Gator fans should look forward to hearing from Ian Williams over the next year. The need for defensive tackles will magnify when the top three on the Gator squad leave after the 2006 season. Williams will be a big part of the mix on the recruiting board for Florida.


text:
Aborigines told to swap land rights for new homes
ABORIGINES living in remote areas throughout Australia will not get a cent of $2 billion in new housing money unless they sign away their land rights for at least 40 years under a controversial Rudd Government plan that NSW indigenous leaders called insulting and dictatorial.
The Indigenous Affairs Minister, Jenny Macklin, was heckled yesterday as she began the difficult process of selling the policy at a conference of Aboriginal land councils in Cessnock.
She said the Council of Australian Governments had allocated a record amount of money to fix unliveable and scarce remote housing, of which the NSW share was just under $400 million.
But Ms Macklin has asked state and territory housing ministers to place the 40-year lease condition on all grants, as well as insisting on regular public housing tenancy arrangements - and the resolution of native title claims - before the money is spent. The Rudd Government has done similar deals with communities in South Australia and the Northern Territory.
Despite the role land played in indigenous spirituality and well-being, governments would continue to shirk their responsibility for Aboriginal housing until they had secure tenure over the land it sits on, she said.
The policy is a milder version of a Howard government approach in the Northern Territory, which required 99-year leases, but is being extended to all states and territories for the first time.
It represents an about-face for Ms Macklin, who argued against the Howard government policy in 2007, saying land tenure reform should not be a condition of funding for basic services.
It is seen as a death knell for indigenous housing providers, which inherited former missions and reserves in NSW in the 1980s.
If adopted by state governments and Aboriginal landowners, it would mean the end of different rules for many Aboriginal housing tenants, who at present get houses based on need rather than income.
"I don't for one minute underestimate the challenges of this reform agenda," Ms Macklin said, drawing a fiery response from Aboriginal landowners.
Rick Griffiths, chief executive of the Mindaribba land council, which represents indigenous people in the Cessnock area, said it was an insult. "There's no mention of compensation for the leases And what happens if there's a change of state government?" he said. "They don't go to white communities and say this, do they?"
The state's peak Aboriginal body said neither state nor federal governments had discussed the plan with them.
"Aboriginal people just don't trust the Government at the moment. They've got a long way to go to get this up," the NSW Aboriginal Land Council chairwoman, Bev Manton, said.
The land council's chief executive, Geoff Scott, said all Aboriginal landowners were being sidelined because of the sins of a few and the incompetence of state governments.
"I know of no other sector where the owners of the land have been left out of the discussion," he said.
The activist Michael Anderson, a founder of the Aboriginal tent embassy, compared the policy with those of Zimbabwe's President, Robert Mugabe, and the former Australian prime minister William McMahon, who took land from whites and wanted to lease land to blacks, respectively.


text:
I believe the primary duty and obligation of municipal government is to protect and serve its residents and taxpayers. The Township Committee of the Township of Chatham should fulfill that obligation through the action it takes at Township Committee meetings. The meetings of the committee are governed by its resolution on the "Rules and Order of Business of the Township Committee." On Jan. 5, 1998, the committee had a special, non-public meeting to discuss personnel and board and committee appointments. As mayor, Abigail Fair permitted these rules and order of business to be discussed in its executive session. Those rules were adopted by the committee on Jan. 7, 1998. The discussion of those rules at the special meeting was a blatant violation of the N.J. Open Public Meetings Act (Sunshine Law). When I made this violation public, all Fair could saw was "I'm sorry it occurred."
These same rules are being used to limit the public's right to speak out at public meetings of the committee.
The committee usually has two public meetings a month, a regular meeting and a workshop meeting. Individual members of the public are permitted to be heard at regular meetings, but are asked to limit their comments to three minutes or face the probability of being cut off by the mayor.
There is no provision for the public to be heard at workshop meetings.
The public has learned, primarily through letters to the editor from Stanley Kravitz and myself, that the jitney bus service to the Chatham train station has be en costing township taxpayers thousands of dollars to service just a few residents.
It appeared that the committee was prepared to discontinue that service at the end of May 2001.
The service was continued after Gary Schneider, head of the Chatham Township Jitney Committee, said at the June 4, 2001, special Township Committee meeting that he had "31 known riders who would pay $100 a month."
At the Township Committee's Sept. 13 workshop meeting, Committeewoman Fair proposed reducing the monthly fare to $75. Fair said the reduced fare and other minor changes should result in six-month (Oct. 1, 2001, to March 31, 2002) revenue of $26,600, or $4,333 a month. Based on Fair's forecast revenue, the committee reduced the fare.
I pointed out Fair's unrealistic forecast and other matter in letters to the committee dated Oct. 4 and Oct. 6. As editor of our local newspaper, you were given copies of those letters. I encourage you to use them to keep the public informed.
After Fair received my Oct. 4 letter, she telephoned me and advised that the $26,600 revenue was an "off the cuff" statement that she could not support.
At the Sept. 27 regular meeting of the committee, Stanley Kravitz and I raised the various points in our letters to the editor. After we spoke, the committee remained silent. They did not offer any explanation for acting on such frivolous information.
The lower monthly fare, $75 vs. $100, resulted in 17 monthly passes being sold in October for $1,275. Monthly ridership in October was 14, or 45 percent, fewer monthly riders than Schneider's "31 known riders."
The public should also know that neither Gary Schneider nor any of his supporters who appeared at the June 4 special meeting have appeared at subsequent Township Committee meetings. Maybe they are part of the 14 jitney advocates who have found a solution to their stated problem.
The Jitney bus service was not discussed at the Oct. 11 workshop meeting.
While the rules of order do not permit the public to speak at workshop meetings, Mayor Hoag made one exception on Oct. 11 her husband, Ervin.
If the public wants a more open township government and a Township Committee guided by basic fiscal analysis rather than off the cuff analysis, the choice is clear. Vote for I. William Spraitzar on Election Day, Nov. 6.
May Drive
Chatham Township


text:
Promotional price valid on web orders only. Your contract pricing may differ. Interested in signing up for a dedicated account number?
Learn More
Learn More
Restek SGE Standard Micro-Liter Syringes for Agilent 7673/7683/7693A/6850
For use with Agilent 7673, 7683, 7693A and 6850 Autosamplers
Manufacturer: Restek 21214
Specifications Description & Specifications
|23-26s ga.
Provide Content Correction
We continue to work to improve your shopping experience and your feedback regarding this content is very important to us. Please use the form below to provide feedback related to the content on this product.
Product Title
Thank You!
Your feedback has been submitted. Fisher Scientific is always working to improve our content for you. We appreciate your feedback.Ok


text:
by Igor Slamoff
Palestinians' claims to solidarity from others against Israel's oppression are not very credible. Whenever Palestinians have held power in neighboring territories they have behaved just as arrogantly toward the local population as the Israelis. In the early 1980s southern Lebanon was ruled by the PLO. The region was nicknamed "Fatah-land". When the Israeli army invaded Lebanon in 1982, the Shia inhabitants of southern Lebanon greeted the Israelis as liberators, with flowers,[1] They were so glad to be rid of their Palestinian masters.
But the Israelis were just as stupid and arrogant as the Palestinians and they soon annoyed the Shia so much that the Shia set up a fighting force called Hezbollah that expelled the Israelis from Lebanon. Hezbollah is the only fighting force that has been able to beat the Israeli army decisively and as such is an admirable institution. But an institution made by Israel.
The Lebanese population is grateful to Hezbollah because it keeps the Israelis at bay, but Hezbollah's effect on internal political life in Lebanon is extremely pernicious and reactionary.[2]
Israel's other principal foe in the region is Hamas. Would you believe it that Israel was also the founder of Hamas?! The Shin Bet created Hamas from scratch in order to compete with the secular PLO. The whole sordid story is recounted by Stephen Zunes.[3]
Consequently Israel's claims to solidarity from others against its Arab foes are not very credible either.
Israel has generally followed excessively harsh, short-sighted policies. You know who said that? Not Yassir Arafat, but Walter Laqueur, the eminent Jewish historian and expert on terrorism and the Middle East, who is definitely pro-Israel.
And there is room for legitimate criticism of Israeli policy; I for one have been more than uneasy since 1967 about Israeli policy vis-a-vis the West Bank and Gaza which I thought shortsighted and self defeating. This explains why Israel lost a great deal of sympathy.[4]
Consequently, I think supporters of both Israel and the Palestinians should take a step back and view their respective champions with more skepticism.
[1] The War of Lies, by Uri Avnery, online, June 11, 2012
[2] Hizballah development and the political economy of pain, by Bassam Haddad, Jadaliyya, http://www.jadaliyya.com/pages/index/5959/hizballah-development-and-the-political-economy-of
[3] America's Hidden Role in Hamas's Rise to Power, by Stephen Zunes, AlterNet
Posted on January 3, 2009, http://www.alternet.org/story/116855/
[4] An Interview with Walter Laqueur, by Alexander H. Joffe, Covenant, Global Jewish Magazine, Volume 1, Issue 1 (November2006 / Cheshvan 5767)


text:
Product Information
I love everything about this but unfortunately it doesn't work well with my sonata :( won't stay in place right. Pretty sure it works best in suvs which sucks for me. :(
This pet seat cover is much nicer than I thought it would be. It's plush, and completely covers my back seat. The dogs love it.


text:
Magic under the mistletoe . . .
One spectacular Christmas, Lady Perdita Selby, known to her friends and family as Poppy, met the man she thought she would love forever. The devilishly attractive Duke of Fletcher was the perfect match for the innocent, breathtakingly beautiful young Englishwoman, and theirs was the most romantic wedding she had ever seen. Four years later, Poppy and the duke have become the toast of the ton . . . but behind closed doors the spark of… (more)
Good day. It's my pleasure meeting you, and that you enjoying your day? Can you allowed me to introduce my self to you. My name is Kine Gaye . I will like to get acquainted with you. please I'll be glad if you write to me or send your email address direct at my private email address (email@example.com) because i have some important thing i will like to discuss with you privately.
Hope to hear from you soon.
Publisher: Avon (October 13, 2009)
Format: EPUB
Page count: 400 pages
File size: 895 KB
Protection: DRM
Language: English


text:
by Staff Writers
Washington DC (SPX) Oct 10, 2013
NASA's Juno spacecraft launched aboard an Atlas V rocket from Cape Canaveral Air Force Station, Fla., Aug. 5, 2011, beginning a five-year journey to Jupiter. But it wasn't charted on a direct path.
Before it reaches its destination, Juno will greet the Earth one last time. The spacecraft will perform a flyby Oct. 9, passing within 347 miles of Earth.
The flyby will function as a gravity assist for Juno, with Earth's gravity accelerating the solar-powered spacecraft's velocity by 16,330 miles per hour. NASA launched Juno to an area just past Mars, then two main engine burns executed a year ago maneuvered it back around toward Earth.
The purpose of using a gravity assist to get Juno on its way to Jupiter is one of cost.
"A direct mission to Jupiter would have required about 50 percent more fuel than we loaded," said Tim Gasparrini, Juno program manager for Lockheed Martin Space Systems. "Had we not chosen to do the flyby, the mission would have required a bigger launch vehicle, a larger spacecraft and would have been more expensive."
Lockheed Martin's Juno team is playing an active and varied role in the mission and is preparing for the flyby.
""While flying Juno is a team effort, the core operations are in Denver," said Gasparrini.
"We are responsible for systems engineering, subsystem performance and execution of the commanding that goes to the Juno spacecraft. During the flyby, the team will be monitoring the spacecraft because gravity is doing all the work."
NASA's Jet Propulsion Laboratory is providing the critical navigation for the mission and the flyby.
In the lead up to the flyby, Gasparrini's team has been active monitoring Juno.
"We've been doing final reviews on sequences necessary to conduct the flyby," said Jeff Lewis, spacecraft engineer and Lockheed Martin Space Systems operations lead for Juno. "Most of the commanding is folded into our 28-day background sequence, and most of the sequences started on Sept. 27."
For Lewis and others on the team, a big part of positioning Juno for a successful gravity assist is to ensure the spacecraft steers clear of other objects in its vicinity.
"The day of the Earth flyby, the team will be on hand to monitor things," said Lewis. "We have a couple of possible collision avoidance maneuvers to select from, looking at all the satellites around the Earth. We are passing inside the orbits of geostationary spacecraft."
Catching a velocity boost isn't the only value in the effort. The operation also will permit officials to test Juno's instruments and observe the spacecraft's flight handling.
"We'll exercise the science instruments, since Juno's instruments will be operating in a magnetospheric environment for the first time," said Lewis. "The Earth's magnetic field will allow a number of the instruments to be tested. We're also using the flyby of the moon as an opportunity to gauge how the spacecraft operates. Since Juno is a spinning spacecraft, we need to sense the right time to take data as the Moon, or Jupiter, passes through the instruments' fields of view."
On Aug. 12, Juno achieved a milestone by reaching the halfway point on its trek to Jupiter as it had traveled 9.46 astronomical units, equivalent to 879,733,760 miles, at that point. Demonstrating fortuitous timing, the spacecraft is scheduled to reach Jupiter July 4, 2016.
Juno's primary mission is to study Jupiter's atmosphere as a means of better understanding how the planet, and by extension, the solar system originated and evolved. Juno will employ its suite of scientific instruments to peer beneath the planet's dense cloud cover to study the existence of a solid planetary core, map Jupiter's magnetic field, measure water content in the atmosphere and study the planet's auroras.
The spacecraft will orbit Jupiter for about one year, or 33 orbits, operating at times as close as 3,100 miles above the planet's clouds.
According to Gasparrini, the Lockheed Martin Juno team is working collaboratively with other members of the overall Juno program team to ensure mission success. Other team members include NASA, the Jet Propulsion Laboratory, the Southwest Research Institute - including Scott Bolton, Juno's principal investigator - and a number of scientists throughout the world.
As the flyby approaches, Gasparrini and team are locked in and ready.
"The team is 100 percent focused on executing the Earth flyby successfully," said Gasparrini. "We've spent a lot of time looking at possible off-nominal conditions. In the presence of a fault, the spacecraft will stay healthy and will perform as planned."
Related Links
Juno mission website
Juno at Lockheed Martin
Jupiter and its Moons
Explore The Ring World of Saturn and her moons
The million outer planets of a star called Sol
News Flash at Mercury
|The content herein, unless otherwise known to be public domain, are Copyright 1995-2014 - Space Media Network. AFP, UPI and IANS news wire stories are copyright Agence France-Presse, United Press International and Indo-Asia News Service. ESA Portal Reports are copyright European Space Agency. All NASA sourced material is public domain. Additional copyrights may apply in whole or part to other bona fide parties. Advertising does not imply endorsement,agreement or approval of any opinions, statements or information provided by Space Media Network on any Web page published or hosted by Space Media Network. Privacy Statement


text:
Butler questions benefit of Coober Pedy housing plan
Category: Headline News
There is doubt about the benefits of a transitional housing facility for Aboriginal people in Coober Pedy, a member of the National Congress of Australia's First Peoples, Brian Butler has warned.
The South Australian Government announced the construction of the $3.4 million facility would be brought forward to stimulate the building industry.
Mr Butler is an Elder with long experience in housing and policy issues for Indigenous people and doubts the facility will benefit Aboriginal people.
Mr Butler said Coober Pedy had many services already and resources established in more remote locations with the input of people from the area would be more beneficial.
"I strongly believe from past practices, from past programs that have come to Coober Pedy, Aboriginal people really haven't benefited from those programs," he said.
He said there are existing facilities that could be better used, rather than building new ones.
"If they need to develop anything, they should build on what they've already got, instead of planning to set up some new thing that's not going to have the input of Aboriginal people," he said.
"They've got to own the program, they've got to own anything that comes in."


text:
Preparation time: 15-25 minutes
Cooking time: 20-25 minutes
1. Preheat oven to 350 degrees Fahrenheit, line cupcake pan. Mix water and milk, then heat until boiling. Add the three tea bags. Let steep while you are mixing the other ingredients.
2. In a bowl, combine all dry ingredients. Mash one of your bananas until clumpy, then add the mashed mess to bowl.
3. Take the tea bags out of the water/milk and measure 1 cup tea, set aside. Make a well in the center of the dry ingredients and add vanilla, oil, tea, and vinegar. Stir until just mixed.
4. Fill cupcake liners 2/3 full (about two spoon full's). Chop up second banana into thin slices, and add about 2-3 slices in each liner, barely sticking out of cupcake mix.
Follow us on twitter and facebook!
P.S Why not check out our latest project? The Burrow Housing Co-operative
P.P.S: Our friend Jacob has just started a campaign for awesome sex and relationship education, something which we totally support as sex and relationship education in the UK and beyond is limited as it is and constantly under threat. Check out the campaign here, or via their facebook.