Learn More
Merging two sorted arrays is a prominent building block for sorting and other functions. Its efficient parallelization requires balancing the load among compute cores, minimizing the extra work brought about by parallelization, and minimizing inter-thread synchronization requirements. Efficient use of memory is also important. We present a novel approach to(More)
Merging two sorted arrays is a prominent building block for sorting and other functions. Its efficient parallelization requires balancing the load among compute cores, minimizing the extra work brought about by parallelization, and minimizing inter-thread synchronization requirements. Due to the extremely low compute to memoryaccess ratio, it is also(More)
An instruction to create the geometry of a new book can now be sent, BkSlf111]1].Create(FreeBookIndex); and the entries are mapped into the new book, using the new book's Insert methods: 6 Conclusions We have considered the problem of productively displaying multitude of data originating at various sources: les, databases, the WWW and others. This multitude(More)
The detection of events in an active database system turns out to be a difficult problem due to the expressive event specification languages proposed in the recent past which include, among others, complexly defined events (composite events). Therefore, a mechanism is required that is suitable to model the semantics of composite events and to implement the(More)
  • 1