Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Michael G. Norman"'
On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
Publikováno v:
Mathematics of Operations Research. 23:339-358
We derive some basic results on the geometry of semidefinite programming (SDP) and eigenvalue-optimization, i.e., the minimization of the sum of the k largest eigenvalues of a smooth matrix-valued function. We provide upper bounds on the rank of extr
Autor:
Pablo Moscato, Michael G. Norman
Publikováno v:
INFORMS Journal on Computing. 10:121-132
We show how, by a constructive process, we can generate arbitrarily large instances of the Traveling Salesman Problem (TSP) using standard fractals such as those of Peano, Koch, or Sierpinski. We show that optimal solutions for these TSPs can be know
Publikováno v:
ACM SIGMOD Record. 25:16-21
In a 'shared-nothing' parallel computer, each processor has its own memory and disks and processors communicate by passing messages through an interconnect. Many academic researchers, and some vendors, assert that shared-nothingness is the 'consensus
Publikováno v:
Parallel Processing Letters. :331-341
We show the NP-Completeness of two processor scheduling with tasks of execution time 1 or 2 units and unit interprocessor communication latency. We develop a model of scheduling in the presence of communication contention, and show the NP-Completenes
Autor:
Michael G. Norman, Pablo Moscato
Publikováno v:
Chaos, Solitons & Fractals. 6:389-397
We elucidate the relationship between space-fillling curves and the Euclidean Traveling 2
Publikováno v:
Pure and Applied Geophysics PAGEOPH. 142:545-565
We present a cellular automaton model which simulates the process of seismogenesis using rules for evolution which are derived from the field of fracture mechanics, and include an interplay of positive and negative feedbacks. We describe the implemen
Autor:
Peter Thanisch, Michael G. Norman
Publikováno v:
ACM Computing Surveys. 25:263-302
It is now more than a quarter of a century since researchers started publishing papers on mapping strategies for distributing computation across the computation resources of multiprocessor systems. There exists a large body of literature on the subje
Autor:
Neil Carmichael, Michael G. Norman
Publikováno v:
Future Generation Computer Systems. 8:3-8
Serial architectures and conventional languages (especially Fortran) have been the basis for almost all current industrial applications of high performance computing. Whilst the future of computing is certain to be ‘increasingly parallel’, and so
Publikováno v:
Concurrency: Practice and Experience. 3:687-698
Publikováno v:
Concurrency: Practice and Experience. 2:55-78
We review various properties of irregular graphs and suggest that they may provide useful maps for connecting processors together in distributed-memory MIMD machines. In particular, for many applications the performance of a system in an irregular co