Sciweavers

6584 search results - page 224 / 1317
» Distributed Shared Contexts
Sort
View
175
Voted
HIPC
2005
Springer
16 years 17 days ago
Preemption Adaptivity in Time-Published Queue-Based Spin Locks
Abstract. The proliferation of multiprocessor servers and multithreaded applications has increased the demand for high-performance synchronization. Traditional scheduler-based lock...
Bijun He, William N. Scherer III, Michael L. Scott
JSSPP
2004
Springer
16 years 12 days ago
LOMARC - Lookahead Matchmaking for Multi-resource Coscheduling
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
Angela C. Sodan, Lei Lan
206
Voted
COOPIS
2003
IEEE
16 years 10 days ago
Profiling and Matchmaking Strategies in Support of Opportunistic Collaboration
With the recent advances in communications technologies and decentralization of work practices, there has been an increase in distributed, remote, computerized work environments. I...
Adriana Santarosa Vivacqua, Melfry Moreno, Jano Mo...
179
Voted
EDOC
2003
IEEE
16 years 10 days ago
Contract Performance Assessment for Secure and Dynamic Virtual Collaborations
In this paper we sketch a framework supporting contract enactment within the context of virtual organisation units that are dynamically created in order to achieve a common object...
Theodosis Dimitrakos, Ivan Djordjevic, Zoran Milos...
208
Voted
ICNP
2002
IEEE
15 years 12 months ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman