Sciweavers

1257 search results - page 166 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
IPPS
2010
IEEE
14 years 8 months ago
Exploiting inter-thread temporal locality for chip multithreading
Multi-core organizations increasingly support multiple threads per core. Threads on a core usually share a single first-level data cache, so thread schedulers must try to minimize ...
Jiayuan Meng, Jeremy W. Sheaffer, Kevin Skadron
EDOC
2011
IEEE
13 years 10 months ago
Resource and Agreement Management in Dynamic Crowdcomputing Environments
Abstract—Open Web-based and social platforms dramatically influence models of work. Today, there is an increasing interest in outsourcing tasks to crowdsourcing environments tha...
Harald Psaier, Florian Skopik, Daniel Schall, Scha...
RTAS
2005
IEEE
15 years 3 months ago
Optimal Time-Variant Resource Allocation for Internet Servers with Delay
The increasing popularity of high-volume performancecritical Internet applications calls for a scalable server design that allows meeting individual response-time guarantees. Cons...
Xiliang Zhong, Cheng-Zhong Xu, Minghua Xu, Jianbin...
DAC
1996
ACM
15 years 2 months ago
Optimal Clock Skew Scheduling Tolerant to Process Variations
1- A methodology is presented in this paper for determining an optimal set of clock path delays for designing high performance VLSI/ULSI-based clock distribution networks. This met...
José Luis Neves, Eby G. Friedman
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
15 years 1 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...