| Presentation | 2004/11/24 Proposal of Single Data Multiple Processes (SDMP) Memory Ken-ichi KURATA, Hiroshi NAKAMURA, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We propose a novel memory termed Single Data Multiple Processes (SDMP) memory. Multiple addresses can be accessed simultaneously in this memory system. Satisfialiblity problem is one of the most difficult NP complete problelms. When a problem with n variables composed of m terms is solved by a single processor, this process is of O(2^n・m) to search all the combinatorial patterns. On the other hand, the time complexity is of O(2^ |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | memory / NP complete problem |
| Paper # | CPSY2004-25 |
| Date of Issue |
| Conference Information | |
| Committee | CPSY |
|---|---|
| Conference Date | 2004/11/24(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Computer Systems (CPSY) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Proposal of Single Data Multiple Processes (SDMP) Memory |
| Sub Title (in English) | |
| Keyword(1) | memory |
| Keyword(2) | NP complete problem |
| 1st Author's Name | Ken-ichi KURATA |
| 1st Author's Affiliation | RCAST, The University of Tokyo() |
| 2nd Author's Name | Hiroshi NAKAMURA |
| 2nd Author's Affiliation | RCAST, The University of Tokyo |
| Date | 2004/11/24 |
| Paper # | CPSY2004-25 |
| Volume (vol) | vol.104 |
| Number (no) | 475 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |