The Petacomp Machine - A MIMD Cluster for Parallel Pattern-mining

Multiple instruction stream-single data stream (MISD) architectures have not found many practical applications in supercomputing. We present a multiple instruction stream-multiple data stream (MIMD) cluster implementation that uses MISD search processors with extreme pattern mining performance as a...

Full description

Saved in:
Bibliographic Details
Published in:2006 IEEE International Conference on Cluster Computing pp. 1 - 10
Main Authors: Birkeland, O.R., Snove, O., Halaas, A., Nedland, M., Saetrom, P.
Format: Conference Proceeding
Language:English
Published: IEEE 01.09.2006
Subjects:
ISBN:1424403278, 9781424403271
ISSN:1552-5244
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Multiple instruction stream-single data stream (MISD) architectures have not found many practical applications in supercomputing. We present a multiple instruction stream-multiple data stream (MIMD) cluster implementation that uses MISD search processors with extreme pattern mining performance as a building block. We use PCI cards that hold sixteen search processors with local memory to build a relatively small cluster of five PC nodes with six PCI cards each. This cluster can handle anything between 64 independent queries at 48 GB per second, to 30,720 independent queries at 100 MB per second. The cluster's performance characteristics are such that we can easily scale the system to 10 15 operations per second with containable overhead using just 100 nodes. Further, the solution has lower power consumption and memory bandwidth requirements than comparable technologies.
AbstractList Multiple instruction stream-single data stream (MISD) architectures have not found many practical applications in supercomputing. We present a multiple instruction stream-multiple data stream (MIMD) cluster implementation that uses MISD search processors with extreme pattern mining performance as a building block. We use PCI cards that hold sixteen search processors with local memory to build a relatively small cluster of five PC nodes with six PCI cards each. This cluster can handle anything between 64 independent queries at 48 GB per second, to 30,720 independent queries at 100 MB per second. The cluster's performance characteristics are such that we can easily scale the system to 10 15 operations per second with containable overhead using just 100 nodes. Further, the solution has lower power consumption and memory bandwidth requirements than comparable technologies.
Author Halaas, A.
Snove, O.
Saetrom, P.
Nedland, M.
Birkeland, O.R.
Author_xml – sequence: 1
  givenname: O.R.
  surname: Birkeland
  fullname: Birkeland, O.R.
  organization: Interagon AS, Trondheim
– sequence: 2
  givenname: O.
  surname: Snove
  fullname: Snove, O.
  organization: Interagon AS, Trondheim
– sequence: 3
  givenname: A.
  surname: Halaas
  fullname: Halaas, A.
– sequence: 4
  givenname: M.
  surname: Nedland
  fullname: Nedland, M.
– sequence: 5
  givenname: P.
  surname: Saetrom
  fullname: Saetrom, P.
BookMark eNo1jMtOwzAURI0oEm3JD8DGP-Bgx9exvYzCq1IiKkjXlZNc06A8qiQs-HsiAbOZOWcxG7Lqhx4JuRU8FILb-zQ7vBdvYcR5HEohjDQXJLDaCIgAuIyMuSSbf9BmRdZCqYipRVyTYJo--RJQIEW0JklxQrrH2VVDd6a5q05Nj5TRhOa7_IGm7dc040j9MNK9G13bYruMeXE965q-6T9uyJV37YTBX2_J4emxSF9Y9vq8S5OMNUKrmWld1SquudaxNAZqC2hqUEZbi9p6UB69q0tdGu8Vyrjy0tjSA4pIlNxpuSV3v78NIh7PY9O58fsIgnMJIH8AcGlNUw
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CLUSTR.2006.311838
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781424403288
1424403286
EndPage 10
ExternalDocumentID 4100344
Genre orig-research
GroupedDBID 29O
6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i175t-77cd56d07763884d94e8d458799e79f45fefadb7b8ff5e36cf389bf4e121b0a73
IEDL.DBID RIE
ISBN 1424403278
9781424403271
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000244517900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1552-5244
IngestDate Wed Aug 27 02:11:13 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-77cd56d07763884d94e8d458799e79f45fefadb7b8ff5e36cf389bf4e121b0a73
PageCount 10
ParticipantIDs ieee_primary_4100344
PublicationCentury 2000
PublicationDate 2006-Sept.
PublicationDateYYYYMMDD 2006-09-01
PublicationDate_xml – month: 09
  year: 2006
  text: 2006-Sept.
PublicationDecade 2000
PublicationTitle 2006 IEEE International Conference on Cluster Computing
PublicationTitleAbbrev CLUSTR
PublicationYear 2006
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000454312
ssj0037306
Score 1.613911
Snippet Multiple instruction stream-single data stream (MISD) architectures have not found many practical applications in supercomputing. We present a multiple...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Costs
DNA
Energy consumption
Genetics
Hardware
Libraries
Probes
RNA
Sequences
Supercomputers
Title The Petacomp Machine - A MIMD Cluster for Parallel Pattern-mining
URI https://ieeexplore.ieee.org/document/4100344
WOSCitedRecordID wos000244517900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwFLRaxMBUoEV8ywMjpknsxPZYFSqQaJUBpG6VYz9LlUqKSsrvx3aSloGFzfZk-UPv_PzuDqE7B2EjarQkTFsgzGYRKYwEIooo1kli48iaYDbBZzMxn8u8g-53XBgACMVn8OCb4S_frPXWp8qGLA4KdV3U5TyruVq7fIqXkqN76SjqTm5gFqWpf2wx1pK6Ippw0Wo9Nf24ZdNEcjh-9W7F9S8FdejbE1d--a6EsDPp_W_Cx2iw5-_hfBeZTlAHylPUaw0ccHOf-2jkDgnOoVK-sBxPQ10lYIJHePoyfcTj1dbLKGCHa3GuNt51ZeUanv9Tko_gLDFA75Ont_EzaTwVyNIBhcqBaW3SzHgRHyoEM5KBMCwVXErg0rLUglWm4IWwNgWaaesQTWEZxElcRIrTM3RQrks4R5jGoFJDLWilmIascFuruAv4XGr3KoQL1PcrsvisZTMWzWJc_j18hY7q7IYv37pGB9VmCzfoUH9Xy6_NbdjrHzOjodo
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwGG0QTfSECsbf9uDRyrZ263okKIHICAdMuJGt_ZqQ4DA4_Pttuw08ePHW9tT0R77Xr997D6FHA2E9qqQgTGogTEceyZQAEmeeL4NA-55WzmyCTybxfC6mDfS048IAgCs-g2fbdH_5ai23NlXWZb5TqDtAhyFjgVeytXYZFSsmR_fiUdScXcctCkP73GKspnV5NOBxrfZU9f2aT-OJbn9s_YrLfwpq8LelrvxyXnGBZ9D635RPUWfP4MPTXWw6Qw3Iz1GrtnDA1Y1uo545JngKRWpLy3HiKisBE9zDySh5wf3V1gopYINs8TTdWN-VlWlYBlBOPpy3RAe9D15n_SGpXBXI0kCFwsBpqcJIWRkfGsdMCQaxYmHMhQAuNAs16FRlPIu1DoFGUhtMk2kGfuBnXsrpBWrm6xwuEaY-pKGiGmSaMglRZjY35SbkcyHNuxCuUNuuyOKzFM5YVItx_ffwAzoezpLxYjyavN2gkzLXYYu5blGz2GzhDh3J72L5tbl3-_4D162lIQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2006+IEEE+International+Conference+on+Cluster+Computing&rft.atitle=The+Petacomp+Machine+-+A+MIMD+Cluster+for+Parallel+Pattern-mining&rft.au=Birkeland%2C+O.R.&rft.au=Snove%2C+O.&rft.au=Halaas%2C+A.&rft.au=Nedland%2C+M.&rft.date=2006-09-01&rft.pub=IEEE&rft.isbn=9781424403271&rft.issn=1552-5244&rft.spage=1&rft.epage=10&rft_id=info:doi/10.1109%2FCLUSTR.2006.311838&rft.externalDocID=4100344
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1552-5244&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1552-5244&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1552-5244&client=summon