2199 research outputs found
Sort by
Real-Time Scheduling in Command and Control
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/node/17413/87476-thumbnail.jpgReal-time tasks for command and control systems are too large or too complex for one processor to handle. Simply adding more CPUs does not result in a linear increase in performance. Current comparative analysis of parallel algorithms does not accurately reflect the increased cost of scheduling when more processors are added. A case is made that associative processors effectively handle real-time command and control type problems and avoid most of the difficulties introduced by multiprocessors. These results suggest that when comparing different architectures, comparative analysis should consider the ALU and control unit {CU} separately.</p
Pauline Trigère speech and draping demo at KSU Museum, 1999
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/node/18363/Screenshot%202023-09-15%20at%209.59.49%20AM.pngPauline Trigère talks to audience at KSU Museum, and also provides a demonstration of how she cuts and drapes her designs directly on the model.
Photographs of the garment Pauline Trigère can be found here: https://oaks.kent.edu/trigere/objects-pauline-trigere-fashion-papers-collection/draping-demo-garment-pauline-trigere-1999</p
ICON Fall 1999
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/icon/vol34/iss3/1/thumbnail.jp
Footprints, August 1999
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/node/16770/85653-thumbnail.jp
Luna Negra, Fall 1999
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/node/17195/87002-thumbnail.jpgAdditional Staff: Tyler-Lee Murphy, Nate DeWitt, Corinne Henahan, Andrea Bussinger, Bridget Whelan, Rosalyn Miranda, Andrea Calo
Contributors- Carly Sachs, Rosemary Anderson, Felicity Nesham, Nicholas Fillmore, Wolff Bowden, Dave Weinmann, Randall Garrison, Dustin Hathaway, Mary Andrea Calo, Teresa Wax, J. Paul Merry, Mather Schneider, Amara Willey, Mary MacGowan, Maura Gage, Timothy Bugansky, Ben Stivers, Bill Wetherholt, Kristin Berkey-Abbott, Kurt Sampsel, Andy Cleavanger, Molly Geretz, Shawn Selby, Andrea Bussinger, Jocelyn Belden, Stephanie Wilson
Patrons/Donors/Sponsors/Advertisers- Earth Tones, Brady\u27s Cafe, Ledgewood Florist, Evergreen Chinese Restaurant and Buffet, Guido\u27s Original Pizza and Catering, The Image Consultants, Dalton\u27s Furniture, Wheel & Wrench Bicycle Shop, Dream Farms Inc.</p
Crossing Boundaries: Enamels 1999
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/soacatalogs/8/thumbnail.jp
TechKNOW Volume 5, Issue 1
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/techknow/34/thumbnail.jp
The Burr Spring 1999
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/theburr/25/thumbnail.jp
Occopodian 1998
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/cpmyearbooks/37/thumbnail.jp
Simulating PRAM with a MSIMD model (ASC)
No full texthttps://kent-islandora.s3.us-east-2.amazonaws.com/node/16657/87549-thumbnail.jpgThe ASC (MSIMD) model for parallel computation supports a generalized version of an associative style of computing that has been used since the introduction of associative SIMD computers in the early 1970\u27s. In particular, this model supports data parallelism, constant time maximum and minimum operations, one or more instruction streams (ISs) which are sent to a unique set in a dynamic partition of the processors, and assignment of tasks to the ISs using control parallelism. ASC also allows a network to interconnect the processing elements (PEs). This paper shows how ASC can simulate synchronous PRAM, and the converse. These results provide an important step in defining the power of associative model in terms of PRAM which is the most studied parallel model. Also, these simulations will provide numerous algorithms for ASC by giving an automatic method of converting algorithms from PRAM to ASC.</p