Sciweavers

4176 search results - page 100 / 836
» Parallelizing Support Vector Machines on Distributed Compute...
Sort
View
ISPAN
2005
IEEE
15 years 3 months ago
Distributed Algorithmic Mechanism Design for Scheduling on Unrelated Machines
In classical mechanism design setting the outcome of the mechanism is computed by a trusted central party. In this paper we consider distributed implementations in which the outco...
Thomas E. Carroll, Daniel Grosu
JSSPP
2004
Springer
15 years 3 months ago
Multi-toroidal Interconnects: Using Additional Communication Links to Improve Utilization of Parallel Computers
Three-dimensional torus is a common topology of network interconnects of multicomputers due to its simplicity and high scalability. A parallel job submitted to a three-dimensional...
Yariv Aridor, Tamar Domany, Oleg Goldshmidt, Edi S...
SPAA
1993
ACM
15 years 2 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
IPPS
2000
IEEE
15 years 2 months ago
Improving Throughput and Utilization in Parallel Machines through Concurrent Gang
In this paper we propose a new class of scheduling policies, dubbed Concurrent Gang, that combines the advantages of gang scheduling for communication and synchronization intensiv...
Fabrício Alves Barbosa da Silva, Isaac D. S...
ICPP
1993
IEEE
15 years 2 months ago
A Hybrid Shared Memory/Message Passing Parallel Machine
Current and emerging high-performance parallel computer architectures generally implement one of two types of communication mechanisms: shared memory (SM) or message passing (MP)....
Matthew Frank, Mary K. Vernon