50 Years of TOCS. | 0 | 0.34 | 2017 |
Scheduling Matters: Area-Oriented Heuristic for Resource Management | 0 | 0.34 | 2016 |
On constructing DAG‐schedules with large areas | 3 | 0.38 | 2015 |
An AREA-Oriented Heuristic for Scheduling DAGs on Volatile Computing Platforms | 8 | 0.50 | 2015 |
Region Management by Finite-State Robots. | 0 | 0.34 | 2014 |
On Constructing DAG-Schedules with Large AREAs. | 3 | 0.39 | 2014 |
On Scheduling Series-Parallel Dags To Maximize Area | 6 | 0.44 | 2014 |
Finite-State Robots in the Land of Rationalia. | 1 | 0.36 | 2012 |
The Parking Problem for Finite-State Robots. | 1 | 0.36 | 2012 |
Assessing the computational benefits of AREA-oriented DAG-scheduling | 7 | 0.46 | 2011 |
On Clustering Dags For Task-Hungry Computing Platforms | 4 | 0.40 | 2011 |
Heterogeneity In Computing: Insights From A Worksharing Scheduling Problem | 0 | 0.34 | 2011 |
Link-heterogeneity vs. node-heterogeneity in clusters | 3 | 0.39 | 2010 |
Path-robust multi-channel wireless networks | 1 | 0.37 | 2009 |
A "Big-Ideas" Computation Theory Course for the Undergraduate. | 0 | 0.34 | 2008 |
On Clustering Tasks in IC-Optimal Dags | 3 | 0.40 | 2008 |
Extending IC-Scheduling via the Sweep Algorithm | 10 | 0.52 | 2008 |
On “Exploiting” Node-Heterogeneous Clusters Optimally | 8 | 0.48 | 2008 |
Toward a theory for scheduling dags in Internet-based computing | 37 | 1.42 | 2006 |
Theoretical Computer Science: essays in Memory of Shimon Even | 14 | 0.94 | 2006 |
A pebble game for internet-based computing | 4 | 0.41 | 2006 |
Guidelines for scheduling some common computation-dags for Internet-based computing | 28 | 1.30 | 2005 |
The changing challenges of collaborative algorithmics | 1 | 0.35 | 2005 |
Batch-Scheduling dags for internet-based computing | 8 | 0.53 | 2005 |
On the cost-ineffectiveness of redundancy in commercial P2P computing | 21 | 0.86 | 2005 |
An Algorithmic Model For Heterogeneous Hyper-Clusters: Rationale And Experience | 17 | 0.73 | 2005 |
On Scheduling Computation-Dags For Internet-Based Computing | 0 | 0.34 | 2005 |
Obituary: Shimon Even | 0 | 0.34 | 2004 |
Application Placement On A Cluster Of Servers | 14 | 1.08 | 2004 |
Comparing the Structure of Power-Law Graphs and the Internet AS Graph | 18 | 1.58 | 2004 |
On Scheduling Mesh-Structured Computations for Internet-Based Computing | 41 | 1.78 | 2004 |
To BSP or not to BSP in Heterogeneous NOWs | 1 | 0.36 | 2003 |
Using the compiler to improve cache replacement decisions | 60 | 6.52 | 2002 |
HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors | 16 | 1.06 | 2001 |
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations, II: On Maximizing Guaranteed Output | 12 | 2.29 | 2000 |
Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments | 3 | 0.43 | 1999 |
Augmented Ring Networks | 7 | 0.62 | 1999 |
Using Emulations to Enhance the Performance of Parallel Architectures | 1 | 0.35 | 1999 |
An empirical study of dynamic scheduling on rings of processors. | 3 | 0.47 | 1999 |
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations I: On Maximizing Expected Output | 2 | 0.41 | 1999 |
Scheduling time-constrained communication in linear networks | 36 | 1.94 | 1998 |
A Tight Layout of the Butterfly Network | 17 | 0.96 | 1998 |
Theoretical research on networks: models and methodology | 1 | 0.35 | 1997 |
The reconfigurable ring of processors: fine-grained tree-structured computations. | 2 | 0.46 | 1997 |
Work-preserving emulations of fixed-connection networks | 67 | 8.76 | 1997 |
On trading task reallocation for thread management in partitionable multiprocessors | 0 | 0.34 | 1996 |
Toward efficient scheduling of evolving computations on rings of processors | 4 | 0.52 | 1996 |
Thoughts on parallelism and concurrency in compiling curricula | 4 | 0.69 | 1995 |
A Cost-Effective Streamlining of the Diogenes Design Methodology | 0 | 0.34 | 1995 |
Salvage-Embeddings of Complete Trees | 1 | 0.36 | 1995 |