Sciweavers

2057 search results - page 203 / 412
» Scalable and Structured Scheduling
Sort
View
ICPADS
2002
IEEE
14 years 1 months ago
Performance Evaluation of Router Switching Fabrics
Switching fabrics with distributed control for scalable routers have been proposed recently [7]. Such a fabric consists of small routing units (RU’s) interconnected by multistag...
Nian-Feng Tzeng, Malcolm Mandviwalla
ASUNAM
2010
IEEE
13 years 9 months ago
Detecting Highly Overlapping Communities with Model-Based Overlapping Seed Expansion
Abstract--As research into community finding in social networks progresses, there is a need for algorithms capable of detecting overlapping community structure. Many algorithms hav...
Aaron McDaid, Neil Hurley
PLDI
2012
ACM
11 years 10 months ago
Speculative separation for privatization and reductions
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
Nick P. Johnson, Hanjun Kim, Prakash Prabhu, Ayal ...
PPOPP
2010
ACM
14 years 2 months ago
Thread to strand binding of parallel network applications in massive multi-threaded systems
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
Petar Radojkovic, Vladimir Cakarevic, Javier Verd&...
FCCM
2006
IEEE
131views VLSI» more  FCCM 2006»
14 years 2 months ago
Packet Switched vs. Time Multiplexed FPGA Overlay Networks
— Dedicated, spatially configured FPGA interconnect is efficient for applications that require high throughput connections between processing elements (PEs) but with a limited ...
Nachiket Kapre, Nikil Mehta, Michael DeLorimier, R...