Sciweavers

575 search results - page 103 / 115
» Computing Maximum Subsequence in Parallel
Sort
View
DEBS
2007
ACM
13 years 11 months ago
Scalable event matching for overlapping subscriptions in pub/sub systems
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
FGCS
2008
140views more  FGCS 2008»
13 years 7 months ago
Allocation strategies for utilization of space-shared resources in Bag of Tasks grids
As the adoption of grid computing in organizations expands, the need for wise utilization of different types of resources also increases. A volatile resource, such as a desktop co...
César A. F. De Rose, Tiago C. Ferreto, Rodr...
FCCM
2006
IEEE
133views VLSI» more  FCCM 2006»
14 years 1 months ago
A Scalable FPGA-based Multiprocessor
It has been shown that a small number of FPGAs can significantly accelerate certain computing tasks by up to two or three orders of magnitude. However, particularly intensive lar...
Arun Patel, Christopher A. Madill, Manuel Salda&nt...
SPAA
2009
ACM
14 years 8 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
IPPS
2008
IEEE
14 years 1 months ago
Data throttling for data-intensive workflows
— Existing workflow systems attempt to achieve high performance by intelligently scheduling tasks on resources, sometimes even attempting to move the largest data files on the hi...
Sang-Min Park, Marty Humphrey